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 00:16M-RochatM-RochatScore: 22,423Success
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 00:1822,335746,354,696735,073,0002,005,0002,113,536
2May 17, 2026 00:1822,378749,265,167736,478,0002,008,0002,113,536
3May 17, 2026 00:1822,409750,070,786737,506,0002,004,0002,113,536
4May 17, 2026 00:1822,419750,615,526737,842,0002,004,0002,113,536
5May 17, 2026 00:1822,423749,414,710737,972,0002,007,0002,113,536
6May 17, 2026 00:1822,474751,293,260739,642,0002,003,0002,113,536
7May 17, 2026 00:1822,584755,737,839743,269,0002,005,0002,113,536
8May 17, 2026 00:1822,656756,603,308744,621,0003,035,0002,113,536
9May 17, 2026 00:1822,762761,767,777749,172,0002,004,0002,113,536