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 22, 2026 20:14M-RochatM-RochatScore: 18,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:1518,244611,684,581597,975,0004,093,0002,113,536
2May 22, 2026 20:1518,495622,618,379606,200,0004,146,0002,113,536
3May 22, 2026 20:1518,513623,852,600606,914,0004,026,0002,113,536
4May 22, 2026 20:1518,531622,057,874608,522,0003,010,0002,113,536
5May 22, 2026 20:1518,540623,162,465607,809,0004,029,0002,113,536
6May 22, 2026 20:1518,641624,710,273611,128,0004,025,0002,113,536
7May 22, 2026 20:1518,743630,090,481614,487,0004,049,0002,113,536
8May 22, 2026 20:1519,092642,616,953626,019,0004,025,0002,113,536
9May 22, 2026 20:1519,715660,449,448646,612,0004,008,0002,113,536