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 22:01Victor MerckléVictor MerckléScore: 2,251Success
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 22:052,22466,747,826169,947,0001,232,0002,170,880stderr
2Aug 17, 2026 22:052,23166,945,921169,510,0001,238,0002,170,880stderr
3Aug 17, 2026 22:052,24167,244,595169,973,0001,228,0002,170,880stderr
4Aug 17, 2026 22:052,24767,428,280171,860,0001,153,0002,170,880stderr
5Aug 17, 2026 22:052,25167,538,861170,975,0001,240,0002,170,880stderr
6Aug 17, 2026 22:052,25967,783,001169,963,0001,243,0002,170,880stderr
7Aug 17, 2026 22:052,57077,101,254175,964,0001,037,0002,170,880stderr
8Aug 17, 2026 22:052,73682,095,010196,928,0001,206,0002,170,880stderr
9Aug 17, 2026 22:052,87186,140,247191,651,0009,105,0002,154,496stderr