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 listJan 22, 2026 01:44Josu San MartinJosu San MartinScore: 4,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 01:444,404175,573,721145,337,00002,383,872
2Jan 22, 2026 01:444,404170,834,682144,328,0001,002,0002,293,760
3Jan 22, 2026 01:444,413172,598,027142,624,0002,992,0002,396,160
4Jan 22, 2026 01:444,414170,123,974143,681,0001,995,0002,293,760
5Jan 22, 2026 01:444,417173,223,961144,766,000998,0002,293,760
6Jan 22, 2026 01:444,418168,612,557144,802,000998,0002,510,848