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 19:29Josu San MartinJosu San MartinScore: 3,339Success
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 19:313,314121,267,097108,337,0001,050,0002,113,536
2May 13, 2026 19:313,318118,792,123108,476,0001,035,0002,113,536
3May 13, 2026 19:313,319119,402,220108,516,0001,040,0002,113,536
4May 13, 2026 19:313,323118,421,731108,617,0001,052,0002,113,536
5May 13, 2026 19:313,339119,894,407109,146,0001,064,0002,113,536
6May 13, 2026 19:313,343120,911,466109,284,0001,036,0002,113,536
7May 13, 2026 19:313,352119,300,777109,571,0001,046,0002,113,536
8May 13, 2026 19:313,357120,048,097109,757,0001,053,0002,113,536
9May 13, 2026 19:313,361120,050,158109,875,0001,040,0002,113,536