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 18, 2026 00:38Victor MerckléVictor MerckléScore: 2,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 00:412,06061,824,391155,371,0001,150,0002,170,880stderr
2Aug 18, 2026 00:412,06461,949,456155,520,0001,163,0002,170,880stderr
3Aug 18, 2026 00:412,06962,091,341156,029,0001,152,0002,170,880stderr
4Aug 18, 2026 00:412,07162,133,475154,598,0001,017,0002,170,880stderr
5Aug 18, 2026 00:412,09062,722,174158,247,0001,163,0002,170,880stderr
6Aug 18, 2026 00:412,10263,062,623157,948,0001,150,0002,170,880stderr
7Aug 18, 2026 00:412,12063,622,486159,399,0001,169,0002,170,880stderr
8Aug 18, 2026 00:412,12763,818,690160,711,0001,167,0002,170,880stderr
9Aug 18, 2026 00:412,14064,209,900154,979,0001,242,0002,170,880stderr