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 17, 2026 03:27M-RochatM-RochatScore: 20,842Success
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:2820,304609,120,681596,082,0003,302,0002,113,536
2May 17, 2026 03:2820,326609,799,367595,778,0003,246,0002,113,536
3May 17, 2026 03:2820,396611,893,129599,669,0003,272,0002,113,536
4May 17, 2026 03:2820,802624,068,847611,915,0003,246,0002,113,536
5May 17, 2026 03:2820,842625,272,494612,422,0003,313,0002,113,536
6May 17, 2026 03:2820,850625,506,886611,480,0003,368,0002,113,536
7May 17, 2026 03:2820,856625,706,285611,986,0004,010,0002,113,536
8May 17, 2026 03:2820,904627,143,216612,363,0003,011,0002,113,536
9May 17, 2026 03:2821,013630,402,844615,463,0003,284,0002,113,536