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:43Wookyung JeongWookyung JeongScore: 106,397Success
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:43105,8613,534,285,4223,384,505,000108,919,0002,383,872
2Sep 26, 2025 11:43105,9773,525,452,2183,393,295,000103,947,0002,277,376
3Sep 26, 2025 11:43106,0903,532,708,0863,398,023,000102,940,0002,408,448
4Sep 26, 2025 11:43106,1573,536,121,5303,392,224,000110,941,0002,301,952
5Sep 26, 2025 11:43106,3973,541,189,9683,408,155,000102,944,0002,306,048
6Sep 26, 2025 11:43106,7393,549,684,7613,421,424,000100,953,0002,342,912
7Sep 26, 2025 11:43106,8663,558,970,2583,417,649,000108,925,0002,396,160
8Sep 26, 2025 11:43107,3223,573,504,6503,427,705,000113,923,0002,306,048
9Sep 26, 2025 11:43109,3153,643,130,0983,493,471,000113,917,0002,510,848