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 31, 2026 14:37Victor MerckléVictor MerckléScore: 1,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 14:391,69550,869,463120,281,0002,016,0002,170,880stderr
2Aug 31, 2026 14:391,69850,965,420120,989,0002,042,0002,170,880stderr
3Aug 31, 2026 14:391,70551,154,591121,180,0002,059,0002,170,880stderr
4Aug 31, 2026 14:391,71151,330,967121,716,0001,033,0002,170,880stderr
5Aug 31, 2026 14:391,71351,396,470121,465,0002,063,0002,170,880stderr
6Aug 31, 2026 14:391,71751,533,032120,415,0001,027,0002,170,880stderr
7Aug 31, 2026 14:391,72351,694,163120,794,0002,021,0002,170,880stderr
8Aug 31, 2026 14:391,73251,983,777121,803,0001,036,0002,170,880stderr
9Aug 31, 2026 14:391,74152,245,546121,695,0001,034,0002,170,880stderr