Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 18:11M-RochatM-RochatScore: 20,821Success
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 18:1119,755592,654,216578,912,0004,099,0002,113,536
2May 22, 2026 18:1119,941598,230,643584,587,0004,195,0002,113,536
3May 22, 2026 18:1120,638619,167,846601,323,0004,087,0002,113,536
4May 22, 2026 18:1120,780623,401,851609,727,0004,113,0002,113,536
5May 22, 2026 18:1120,821624,643,747608,458,0004,071,0002,113,536
6May 22, 2026 18:1120,834625,026,412610,795,0004,194,0002,113,536
7May 22, 2026 18:1121,032630,986,988617,130,0004,055,0002,113,536
8May 22, 2026 18:1121,583647,519,253633,715,0004,308,0002,113,536
9May 22, 2026 18:1121,778653,361,062638,896,0004,009,0002,113,536