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 listApr 28, 2026 18:33Victor MerckléVictor MerckléScore: 17,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 18:3517,487524,611,484464,093,00043,914,0002,375,680
2Apr 28, 2026 18:3517,610528,308,650464,520,00043,954,0002,375,680
3Apr 28, 2026 18:3517,688530,647,335467,693,00042,880,0002,772,992
4Apr 28, 2026 18:3517,699530,981,180472,531,00042,957,0002,379,776
5Apr 28, 2026 18:3517,716531,493,891468,592,00042,962,0002,551,808
6Apr 28, 2026 18:3517,739532,197,241464,575,00043,865,0002,551,808
7Apr 28, 2026 18:3517,865535,978,782470,936,00043,900,0002,551,808
8Apr 28, 2026 18:3517,897536,939,154471,159,00044,919,0002,371,584
9Apr 28, 2026 18:3518,032540,962,592471,203,00045,922,0002,371,584