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 listSep 26, 2025 11:36Wookyung JeongWookyung JeongScore: 108,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 11:36107,7083,586,761,7453,427,463,000126,906,0002,277,376
2Sep 26, 2025 11:36108,0103,592,339,9523,437,426,000126,904,0002,404,352
3Sep 26, 2025 11:36108,2013,601,435,9823,447,713,000122,918,0002,277,376
4Sep 26, 2025 11:36108,2973,599,779,2213,456,873,000116,928,0002,424,832
5Sep 26, 2025 11:36108,4413,606,729,1683,453,631,000124,914,0002,277,376
6Sep 26, 2025 11:36108,5573,610,850,1083,464,473,000117,914,0002,433,024
7Sep 26, 2025 11:36108,9833,624,325,3613,472,542,000123,912,0002,424,832
8Sep 26, 2025 11:36109,0753,636,415,0183,481,563,000117,917,0002,433,024
9Sep 26, 2025 11:36109,1203,624,556,2363,467,044,000133,924,0002,465,792