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 16, 2026 04:46Victor MerckléVictor MerckléScore: 4,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 04:474,113123,396,012339,537,0001,089,0002,170,880stderr
2Aug 16, 2026 04:474,121123,657,789340,120,0001,094,0002,166,784stderr
3Aug 16, 2026 04:474,140124,214,081338,294,0001,040,0002,170,880stderr
4Aug 16, 2026 04:474,144124,348,431339,420,0001,077,0002,170,880stderr
5Aug 16, 2026 04:474,153124,598,148343,141,0001,015,0002,166,784stderr
6Aug 16, 2026 04:474,156124,687,216342,641,0001,029,0002,166,784stderr
7Aug 16, 2026 04:474,173125,208,017344,706,0001,016,0002,166,784stderr
8Aug 16, 2026 04:474,180125,416,267340,670,0001,060,0002,170,880stderr
9Aug 16, 2026 04:474,190125,715,144345,001,0001,037,0002,170,880stderr