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 22:20Victor MerckléVictor MerckléScore: 7,305Success
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 22:217,219216,581,722207,074,0001,006,0002,138,112stderr
2Aug 16, 2026 22:217,261217,839,444208,250,0001,006,0002,138,112stderr
3Aug 16, 2026 22:217,278218,355,657206,605,0003,235,0002,138,112stderr
4Aug 16, 2026 22:217,297218,938,594207,530,0003,079,0002,138,112stderr
5Aug 16, 2026 22:217,305219,176,876209,663,0001,007,0002,138,112stderr
6Aug 16, 2026 22:217,490224,727,556215,156,0001,006,0002,138,112stderr
7Aug 16, 2026 22:217,497224,913,109213,105,0003,265,0002,138,112stderr
8Aug 16, 2026 22:217,559226,774,423216,122,0002,017,0002,138,112stderr
9Aug 16, 2026 22:218,126243,795,816222,342,0003,020,0002,138,112stderr