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 7, 2025 10:18Rajarshi BasuRajarshi BasuScore: 322,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2025 10:18318,17310,534,137,94110,461,747,00037,977,0002,301,952
2Dec 7, 2025 10:18318,93110,566,076,10110,494,744,00029,979,0002,514,944
3Dec 7, 2025 10:18319,93510,588,072,15610,518,894,00038,973,0002,514,944
4Dec 7, 2025 10:18321,69810,649,952,34810,583,061,00032,978,0002,351,104
5Dec 7, 2025 10:18322,02610,653,458,89510,590,881,00035,979,0002,428,928
6Dec 7, 2025 10:18322,73610,683,940,47410,613,314,00036,980,0002,281,472
7Dec 7, 2025 10:18324,02410,729,807,24110,656,814,00035,979,0002,322,432
8Dec 7, 2025 10:18324,30710,734,026,39210,666,165,00035,976,0002,502,656
9Dec 7, 2025 10:18326,10310,797,305,93710,724,410,00036,973,0002,392,064