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 17, 2026 01:20M-RochatM-RochatScore: 19,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:2219,306645,934,525632,982,0004,117,0002,113,536
2May 17, 2026 01:2219,426651,698,041636,863,0004,217,0002,113,536
3May 17, 2026 01:2219,667658,644,900644,751,0004,264,0002,113,536
4May 17, 2026 01:2219,717661,358,353646,429,0004,247,0002,113,536
5May 17, 2026 01:2219,774664,323,315648,265,0004,286,0002,113,536
6May 17, 2026 01:2219,909665,913,341652,731,0004,291,0002,113,536
7May 17, 2026 01:2220,703694,253,760678,817,0004,398,0002,113,536
8May 17, 2026 01:2221,465720,917,867703,346,0005,030,0002,113,536
9May 17, 2026 01:2221,473717,968,454704,356,0004,284,0002,113,536