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 9, 2026 21:28Victor MerckléVictor MerckléScore: 3,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:353,15194,538,454244,402,0002,199,0002,142,208
2Jun 9, 2026 21:353,16995,076,240248,222,0001,025,0002,142,208
3Jun 9, 2026 21:353,18095,429,969248,603,0002,256,0002,142,208
4Jun 9, 2026 21:353,19495,849,997248,511,0001,189,0002,146,304
5Jun 9, 2026 21:353,19795,930,093249,820,0001,091,0002,142,208
6Jun 9, 2026 21:353,21896,556,228251,543,0002,200,0002,142,208
7Jun 9, 2026 21:353,22196,649,817250,907,0001,039,0002,142,208
8Jun 9, 2026 21:353,22996,870,676253,600,0001,017,0002,142,208
9Jun 9, 2026 21:353,23697,099,664250,230,0002,314,0002,146,304