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 18:24Josu San MartinJosu San MartinScore: 3,422Success
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 18:253,392121,976,225110,916,0001,037,0002,113,536
2May 13, 2026 18:253,393122,413,971110,915,0001,057,0002,113,536
3May 13, 2026 18:253,402121,056,745111,233,0001,056,0002,113,536
4May 13, 2026 18:253,416123,675,588111,680,0001,052,0002,113,536
5May 13, 2026 18:253,422121,719,940111,889,0001,049,0002,113,536
6May 13, 2026 18:253,423121,764,090111,934,0001,049,0002,113,536
7May 13, 2026 18:253,426124,737,248112,040,0001,045,0002,113,536
8May 13, 2026 18:253,430122,601,297112,177,0001,026,0002,113,536
9May 13, 2026 18:253,431122,123,889112,205,0001,042,0002,113,536