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 listJun 11, 2026 00:54Victor MerckléVictor MerckléScore: 3,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:573,29698,908,535252,480,0003,584,0002,150,400
2Jun 11, 2026 00:573,31599,451,607252,578,0003,571,0002,162,688
3Jun 11, 2026 00:573,31599,458,354251,977,0003,572,0002,211,840
4Jun 11, 2026 00:573,31699,505,393253,190,0003,621,0002,150,400
5Jun 11, 2026 00:573,32599,767,263253,400,0003,564,0002,150,400
6Jun 11, 2026 00:573,33199,948,137254,439,0003,629,0002,150,400
7Jun 11, 2026 00:573,350100,528,185254,520,0003,549,0002,150,400
8Jun 11, 2026 00:573,376101,298,519251,563,0003,539,0002,150,400
9Jun 11, 2026 00:573,383101,500,764256,129,0003,577,0002,150,400