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 13:59Victor MerckléVictor MerckléScore: 4,456Success
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 14:024,440133,225,201366,035,0001,216,0002,170,880stderr
2Aug 17, 2026 14:024,442133,270,335366,835,0001,256,0002,170,880stderr
3Aug 17, 2026 14:024,450133,502,454369,032,0001,218,0002,170,880stderr
4Aug 17, 2026 14:024,455133,657,565366,842,0001,242,0002,170,880stderr
5Aug 17, 2026 14:024,456133,680,437367,270,0001,208,0002,170,880stderr
6Aug 17, 2026 14:024,461133,840,246366,464,0001,231,0002,170,880stderr
7Aug 17, 2026 14:024,463133,912,225365,911,0001,234,0002,170,880stderr
8Aug 17, 2026 14:024,464133,933,293365,803,0001,003,0002,170,880stderr
9Aug 17, 2026 14:024,951148,556,904370,364,0002,010,0002,170,880stderr