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:26Victor MerckléVictor MerckléScore: 2,108Success
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:282,09162,759,248156,677,0001,244,0002,170,880stderr
2Aug 16, 2026 18:282,09262,761,245155,855,0001,243,0002,170,880stderr
3Aug 16, 2026 18:282,09962,996,072157,435,0001,231,0002,170,880stderr
4Aug 16, 2026 18:282,10763,214,781156,547,0001,222,0002,170,880stderr
5Aug 16, 2026 18:282,10863,267,326156,838,0001,218,0002,170,880stderr
6Aug 16, 2026 18:282,11963,581,609157,895,0001,236,0002,170,880stderr
7Aug 16, 2026 18:282,12163,643,956157,798,0001,213,0002,170,880stderr
8Aug 16, 2026 18:282,12963,884,151158,628,0001,223,0002,170,880stderr
9Aug 16, 2026 18:282,14264,284,993158,628,0001,230,0002,170,880stderr