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 17:23Victor MerckléVictor MerckléScore: 6,539Success
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 17:246,383191,501,056444,392,00049,043,0002,781,184
2Apr 28, 2026 17:246,464193,933,548444,770,00050,973,0002,719,744
3Apr 28, 2026 17:246,496194,891,592449,270,00042,930,0002,691,072
4Apr 28, 2026 17:246,515195,463,041444,999,00044,899,0002,760,704
5Apr 28, 2026 17:246,539196,191,955463,694,00046,068,0002,711,552
6Apr 28, 2026 17:246,572197,168,757468,979,00042,998,0002,711,552
7Apr 28, 2026 17:246,578197,347,917451,649,00042,060,0002,445,312
8Apr 28, 2026 17:246,668200,045,371455,136,00043,916,0002,707,456
9Apr 28, 2026 17:246,763202,891,526464,910,00046,990,0002,707,456