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 listAug 2, 2026 13:03Victor MerckléVictor MerckléScore: 5,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:045,194155,840,979426,189,0009,839,0002,605,056stderr
2Aug 2, 2026 13:045,200156,001,873428,672,0007,747,0002,605,056stderr
3Aug 2, 2026 13:045,203156,093,705426,888,0009,677,0002,605,056stderr
4Aug 2, 2026 13:045,204156,147,765429,471,0009,275,0002,392,064stderr
5Aug 2, 2026 13:045,228156,867,650428,611,0009,679,0002,605,056stderr
6Aug 2, 2026 13:045,248157,446,326432,231,0009,184,0002,605,056stderr
7Aug 2, 2026 13:045,297158,935,498436,684,0008,637,0002,605,056stderr
8Aug 2, 2026 13:045,312159,388,054436,829,0009,525,0002,605,056stderr
9Aug 2, 2026 13:045,340160,215,777440,037,0009,340,0002,605,056stderr