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 23, 2026 16:45Victor MerckléVictor MerckléScore: 2,085Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:462,02460,725,444148,221,0002,027,0002,170,880stderr
2Aug 23, 2026 16:462,04961,495,360152,320,0001,019,0002,170,880stderr
3Aug 23, 2026 16:462,05261,577,924152,928,0002,004,0002,170,880stderr
4Aug 23, 2026 16:462,08062,416,515153,168,0001,036,0002,170,880stderr
5Aug 23, 2026 16:462,08562,570,246149,559,0001,040,0002,170,880stderr
6Aug 23, 2026 16:462,08862,649,171153,652,0002,019,0002,170,880stderr
7Aug 23, 2026 16:462,10363,090,384155,319,0001,024,0002,170,880stderr
8Aug 23, 2026 16:462,19165,756,018164,642,0002,050,0002,170,880stderr
9Aug 23, 2026 16:462,19865,947,036161,723,0001,022,0002,170,880stderr