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 19, 2025 03:21MylesMylesScore: 277,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 03:21272,7549,033,692,2768,969,916,00030,978,0002,334,720
2Sep 19, 2025 03:21273,5019,060,257,3648,990,553,00034,978,0002,392,064
3Sep 19, 2025 03:21275,1709,118,133,4819,046,623,00033,976,0002,531,328
4Sep 19, 2025 03:21276,5349,159,281,7569,089,651,00035,974,0002,445,312
5Sep 19, 2025 03:21277,8829,205,102,5119,140,137,00029,977,0002,416,640
6Sep 19, 2025 03:21279,7919,266,914,6279,203,136,00029,980,0002,514,944
7Sep 19, 2025 03:21280,0779,270,292,7839,215,572,00026,984,0002,322,432
8Sep 19, 2025 03:21280,3409,282,706,4559,222,231,00028,981,0002,289,664
9Sep 19, 2025 03:21280,4239,285,693,9559,217,991,00035,976,0002,392,064