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 21, 2026 17:54M-RochatM-RochatScore: 18,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:5518,078606,564,236593,566,0003,011,0002,113,536
2May 21, 2026 17:5518,266614,464,749598,772,0004,009,0002,113,536
3May 21, 2026 17:5518,342617,589,317602,288,0003,010,0002,113,536
4May 21, 2026 17:5518,488621,056,550607,120,0003,008,0002,113,536
5May 21, 2026 17:5518,599625,071,636609,789,0004,009,0002,113,536
6May 21, 2026 17:5518,618626,924,120610,403,0004,023,0002,113,536
7May 21, 2026 17:5518,641626,934,495611,152,0004,029,0002,113,536
8May 21, 2026 17:5518,740629,583,391614,371,0004,056,0002,113,536
9May 21, 2026 17:5519,912668,374,767653,088,0004,013,0002,113,536