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 15, 2026 00:02Josu San MartinJosu San MartinScore: 4,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 00:034,686164,580,753153,603,0001,043,0002,113,536
2May 15, 2026 00:034,689163,532,872153,704,0001,048,0002,113,536
3May 15, 2026 00:034,699163,834,208154,017,0001,065,0002,113,536
4May 15, 2026 00:034,700165,556,819154,081,0001,048,0002,113,536
5May 15, 2026 00:034,702164,862,684154,121,0001,054,0002,113,536
6May 15, 2026 00:034,723166,040,458154,816,0001,045,0002,113,536
7May 15, 2026 00:034,729166,726,341155,021,0001,050,0002,113,536
8May 15, 2026 00:034,732166,838,993155,127,0001,053,0002,113,536
9May 15, 2026 00:034,740166,955,378155,362,0001,058,0002,113,536