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 28, 2025 13:55zypehzypehScore: 52,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 13:5552,5921,759,489,5641,701,560,00033,991,0002,502,656
2Dec 28, 2025 13:5552,7281,771,881,5641,708,046,00031,982,0002,502,656
3Dec 28, 2025 13:5552,7551,767,761,4331,709,944,00030,980,0002,392,064
4Dec 28, 2025 13:5552,8931,774,231,3341,711,476,00033,989,0002,490,368
5Dec 28, 2025 13:5552,9071,773,851,6371,710,941,00034,978,0002,498,560
6Dec 28, 2025 13:5552,9691,770,648,9501,714,983,00032,980,0002,301,952
7Dec 28, 2025 13:5553,0571,777,627,9441,716,904,00033,978,0002,355,200
8Dec 28, 2025 13:5553,0771,778,030,4141,719,553,00031,991,0002,486,272
9Dec 28, 2025 13:5553,5891,801,682,4601,733,436,00034,988,0002,498,560