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 23, 2025 17:34zielajzielajScore: 4,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 17:344,180159,760,012124,941,00012,993,0002,457,600
2Dec 23, 2025 17:344,189160,307,573129,228,0009,015,0002,494,464
3Dec 23, 2025 17:344,202162,858,529128,684,0009,975,0002,469,888
4Dec 23, 2025 17:344,204158,394,948132,744,0005,988,0002,379,776
5Dec 23, 2025 17:344,214160,165,567125,059,00014,006,0002,453,504
6Dec 23, 2025 17:344,215163,160,240130,102,0009,007,0002,392,064
7Dec 23, 2025 17:344,232164,543,400127,684,00011,970,0002,408,448
8Dec 23, 2025 17:344,237160,402,651125,854,00013,983,0002,441,216
9Dec 23, 2025 17:344,240158,801,748129,923,0009,994,0002,433,024