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:31M-RochatM-RochatScore: 21,089Success
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:3220,905627,172,349611,993,0004,110,0002,113,536
2May 21, 2026 17:3220,927627,833,626613,539,0004,120,0002,113,536
3May 21, 2026 17:3220,992629,771,000616,053,0004,185,0002,113,536
4May 21, 2026 17:3221,022630,688,982616,958,0004,142,0002,113,536
5May 21, 2026 17:3221,089632,680,790617,992,0004,154,0002,113,536
6May 21, 2026 17:3221,163634,898,547619,869,0004,115,0002,113,536
7May 21, 2026 17:3221,280638,420,887622,988,0004,010,0002,113,536
8May 21, 2026 17:3221,392641,776,004625,347,0005,208,0002,113,536
9May 21, 2026 17:3221,729651,884,517635,500,0004,221,0002,113,536