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 11, 2025 15:54Rajarshi BasuRajarshi BasuScore: 21,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:5421,309737,021,247687,216,00015,981,0002,445,312
2Dec 11, 2025 15:5421,313731,853,072688,331,00014,985,0002,379,776
3Dec 11, 2025 15:5421,361731,922,167690,931,00013,998,0002,424,832
4Dec 11, 2025 15:5421,408734,691,562688,488,00017,986,0002,441,216
5Dec 11, 2025 15:5421,436736,133,710687,398,00019,982,0002,437,120
6Dec 11, 2025 15:5421,501740,124,888688,563,00020,986,0002,387,968
7Dec 11, 2025 15:5421,589736,936,471695,452,00016,986,0002,506,752
8Dec 11, 2025 15:5421,648747,653,675696,399,00017,984,0002,334,720
9Dec 11, 2025 15:5423,450803,317,333757,865,00015,976,0002,375,680