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 listMay 13, 2026 03:44Josu San MartinJosu San MartinScore: 3,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 03:453,595128,653,535117,549,0001,089,0002,113,536
2May 13, 2026 03:453,598130,709,282117,673,0001,093,0002,113,536
3May 13, 2026 03:453,599127,586,656117,761,0001,033,0002,113,536
4May 13, 2026 03:453,600130,176,916117,706,0001,097,0002,113,536
5May 13, 2026 03:453,600127,624,016117,744,0001,063,0002,113,536
6May 13, 2026 03:453,602128,598,816117,824,0001,059,0002,113,536
7May 13, 2026 03:453,608128,427,753117,978,0001,096,0002,113,536
8May 13, 2026 03:453,609128,868,216118,071,0001,046,0002,113,536
9May 13, 2026 03:453,610130,371,041118,069,0001,088,0002,113,536