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 listJun 26, 2026 23:47Victor MerckléVictor MerckléScore: 2,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 23:482,83985,176,947227,997,0003,020,0002,658,304
2Jun 26, 2026 23:482,84585,375,776228,159,0003,119,0002,658,304
3Jun 26, 2026 23:482,84585,363,957228,190,0003,079,0002,658,304
4Jun 26, 2026 23:482,84685,391,921230,604,0001,019,0002,658,304
5Jun 26, 2026 23:482,84985,477,270228,560,0003,081,0002,658,304
6Jun 26, 2026 23:482,85985,798,288227,879,0003,068,0002,658,304
7Jun 26, 2026 23:482,88086,411,211230,532,0003,107,0002,658,304
8Jun 26, 2026 23:482,89086,712,518232,427,0003,064,0002,658,304
9Jun 26, 2026 23:482,91587,455,599229,936,0003,141,0002,658,304