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 18, 2026 00:58M-RochatM-RochatScore: 32,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:5932,337970,131,328939,281,00019,298,0002,125,824
2May 18, 2026 00:5932,397971,924,048942,255,00019,311,0002,125,824
3May 18, 2026 00:5932,405972,171,961942,028,00019,228,0002,125,824
4May 18, 2026 00:5932,443973,301,414941,514,00019,257,0002,125,824
5May 18, 2026 00:5932,586977,606,420944,456,00020,049,0002,125,824
6May 18, 2026 00:5932,807984,231,204953,190,00019,281,0002,125,824
7May 18, 2026 00:5932,936988,100,875958,591,00019,195,0002,125,824
8May 18, 2026 00:5932,991989,741,916960,055,00019,243,0002,125,824
9May 18, 2026 00:5933,036991,099,534958,353,00019,192,0002,125,824