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 17, 2026 21:51Victor MerckléVictor MerckléScore: 3,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 21:583,17395,210,502256,106,0001,139,0002,170,880stderr
2Aug 17, 2026 21:583,18495,541,490255,549,0001,261,0002,170,880stderr
3Aug 17, 2026 21:583,18895,666,052255,329,0001,226,0002,170,880stderr
4Aug 17, 2026 21:583,18995,698,785256,656,0001,209,0002,170,880stderr
5Aug 17, 2026 21:583,19295,770,912255,612,0001,215,0002,170,880stderr
6Aug 17, 2026 21:583,19395,801,956254,751,0001,275,0002,170,880stderr
7Aug 17, 2026 21:583,20996,295,983255,358,0001,216,0002,170,880stderr
8Aug 17, 2026 21:583,21096,309,159255,549,0001,219,0002,170,880stderr
9Aug 17, 2026 21:583,21596,468,944256,067,0001,219,0002,170,880stderr