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 21, 2026 17:42M-RochatM-RochatScore: 21,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:4321,012630,376,610614,445,0004,185,0002,113,536
2May 21, 2026 17:4321,187635,625,512621,215,0004,161,0002,113,536
3May 21, 2026 17:4321,455643,675,225629,158,0004,173,0002,113,536
4May 21, 2026 17:4321,495644,870,954631,184,0004,168,0002,113,536
5May 21, 2026 17:4321,866656,002,802639,811,0004,184,0002,113,536
6May 21, 2026 17:4322,047661,413,080647,014,0004,053,0002,113,536
7May 21, 2026 17:4322,099662,985,733648,488,0004,033,0002,113,536
8May 21, 2026 17:4322,699680,973,313667,297,0004,125,0002,113,536
9May 21, 2026 17:4323,016690,488,001673,812,0004,064,0002,113,536