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 22, 2025 02:24Josu San MartinJosu San MartinScore: 57,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 02:2457,3551,919,075,2691,854,741,00037,974,0002,289,664
2Dec 22, 2025 02:2457,3591,917,216,3391,848,882,00043,973,0002,457,600
3Dec 22, 2025 02:2457,4001,927,776,4951,852,214,00041,982,0002,510,848
4Dec 22, 2025 02:2457,4171,929,024,0311,853,801,00040,973,0002,285,568
5Dec 22, 2025 02:2457,5591,929,512,8521,853,462,00045,986,0002,510,848
6Dec 22, 2025 02:2457,7001,927,320,2791,864,129,00039,981,0002,461,696
7Dec 22, 2025 02:2457,7881,934,472,7041,868,017,00038,979,0002,531,328
8Dec 22, 2025 02:2458,0021,936,559,7071,872,091,00041,979,0002,285,568
9Dec 22, 2025 02:2458,1341,944,397,8991,877,469,00040,966,0002,285,568