Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listDec 19, 2025 08:12Rajarshi BasuRajarshi BasuScore: 7,966Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 08:127,849287,270,295252,013,0007,000,0002,338,816
2Dec 19, 2025 08:127,867289,076,386250,612,0008,986,0002,490,368
3Dec 19, 2025 08:127,868290,652,820251,646,0007,988,0002,347,008
4Dec 19, 2025 08:127,919287,723,142250,308,00011,013,0002,510,848
5Dec 19, 2025 08:127,966289,766,543256,866,0005,996,0002,404,352
6Dec 19, 2025 08:128,013293,953,834257,448,0006,985,0002,428,928
7Dec 19, 2025 08:128,046290,801,085258,534,0006,987,0002,355,200
8Dec 19, 2025 08:128,049292,804,626256,615,0008,986,0002,519,040
9Dec 19, 2025 08:128,439307,512,729270,512,0007,985,0002,461,696