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 listNov 20, 2025 20:52izotoffizotoffScore: 86,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 20:5285,5592,853,201,5262,802,463,00020,988,0002,412,544
2Nov 20, 2025 20:5285,8072,857,878,9942,812,658,00018,984,0002,424,832
3Nov 20, 2025 20:5286,0322,866,300,1612,812,074,00026,981,0002,387,968
4Nov 20, 2025 20:5286,2202,871,392,4792,815,265,00029,981,0002,359,296
5Nov 20, 2025 20:5286,3612,882,708,9402,820,950,00028,978,0002,510,848
6Nov 20, 2025 20:5286,6032,887,932,3102,833,916,00023,982,0002,478,080
7Nov 20, 2025 20:5286,9992,900,672,0322,836,995,00033,975,0002,547,712
8Nov 20, 2025 20:5287,0202,905,578,2262,841,672,00029,975,0002,490,368
9Nov 20, 2025 20:5292,6653,086,370,7923,031,959,00025,982,0002,408,448