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 03:23M-RochatM-RochatScore: 18,572Success
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 03:2518,371617,685,032602,875,0003,388,0002,113,536
2May 17, 2026 03:2518,407617,925,796604,306,0003,129,0002,113,536
3May 17, 2026 03:2518,499619,975,847607,480,0003,010,0002,113,536
4May 17, 2026 03:2518,502621,420,659607,400,0003,189,0002,113,536
5May 17, 2026 03:2518,572623,649,045609,554,0003,325,0002,113,536
6May 17, 2026 03:2518,725627,046,964614,932,0003,010,0002,113,536
7May 17, 2026 03:2518,776630,304,207616,336,0003,293,0002,113,536
8May 17, 2026 03:2519,058637,947,880625,621,0003,309,0002,113,536
9May 17, 2026 03:2519,415651,593,191636,699,0004,012,0002,113,536