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 18:20Victor MerckléVictor MerckléScore: 3,104Success
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 18:213,06992,071,629241,872,0001,006,0002,203,648stderr
2Aug 16, 2026 18:213,06992,089,905243,103,0001,003,0002,232,320stderr
3Aug 16, 2026 18:213,08492,541,259242,512,0002,031,0002,260,992stderr
4Aug 16, 2026 18:213,08992,680,163243,322,0001,004,0002,203,648stderr
5Aug 16, 2026 18:213,10493,128,648243,495,0001,004,0002,203,648stderr
6Aug 16, 2026 18:213,11093,303,160244,251,0001,003,0002,265,088stderr
7Aug 16, 2026 18:213,12193,644,894242,763,0002,053,0002,224,128stderr
8Aug 16, 2026 18:213,15294,580,885249,236,0002,024,0002,228,224stderr
9Aug 16, 2026 18:213,31899,551,329243,718,0002,096,0002,260,992stderr