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 listSep 1, 2026 04:09Victor MerckléVictor MerckléScore: 1,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 04:121,90357,110,860139,534,0002,030,0002,170,880stderr
2Sep 1, 2026 04:121,91557,460,938140,042,0002,041,0002,170,880stderr
3Sep 1, 2026 04:121,92957,884,055140,070,0002,021,0002,170,880stderr
4Sep 1, 2026 04:121,94058,227,589140,642,0001,032,0002,170,880stderr
5Sep 1, 2026 04:121,94258,260,513140,546,0001,035,0002,170,880stderr
6Sep 1, 2026 04:121,94258,273,802140,743,0002,048,0002,170,880stderr
7Sep 1, 2026 04:121,94658,391,055140,846,0002,016,0002,170,880stderr
8Sep 1, 2026 04:121,96558,964,427141,368,0001,040,0002,170,880stderr
9Sep 1, 2026 04:121,98359,491,311139,573,0001,026,0002,170,880stderr