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 10:02Rajarshi BasuRajarshi BasuScore: 6,703Success
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 10:026,655246,585,203212,640,0006,988,0002,379,776
2Dec 19, 2025 10:026,681243,166,063209,513,00010,974,0002,338,816
3Dec 19, 2025 10:026,694243,777,798210,920,0009,996,0002,445,312
4Dec 19, 2025 10:026,699245,834,702215,059,0006,001,0002,514,944
5Dec 19, 2025 10:026,703244,222,138214,179,0007,005,0002,510,848
6Dec 19, 2025 10:026,707248,847,027213,317,0008,011,0002,433,024
7Dec 19, 2025 10:026,707254,146,862215,333,0006,009,0002,392,064
8Dec 19, 2025 10:026,737248,020,523214,324,0008,012,0002,281,472
9Dec 19, 2025 10:026,778248,112,158218,669,0004,992,0002,338,816