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 17:44Victor MerckléVictor MerckléScore: 2,117Success
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 17:482,06862,062,656154,921,0001,216,0002,170,880stderr
2Aug 16, 2026 17:482,09962,981,318155,947,0001,256,0002,170,880stderr
3Aug 16, 2026 17:482,11463,448,607154,794,0001,246,0002,170,880stderr
4Aug 16, 2026 17:482,11563,461,866156,393,0001,233,0002,170,880stderr
5Aug 16, 2026 17:482,11763,513,591154,903,0001,235,0002,170,880stderr
6Aug 16, 2026 17:482,11963,589,748158,688,0001,245,0002,170,880stderr
7Aug 16, 2026 17:482,12263,670,753156,011,0001,237,0002,170,880stderr
8Aug 16, 2026 17:482,13363,992,459154,814,0001,247,0002,170,880stderr
9Aug 16, 2026 17:482,17765,315,979154,868,0001,257,0002,170,880stderr