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:47Victor MerckléVictor MerckléScore: 8,703Success
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:487,644229,324,288569,847,00044,987,0002,613,248
2Apr 28, 2026 18:487,696230,881,611561,273,00048,936,0002,703,360
3Apr 28, 2026 18:488,544256,340,482586,048,00045,847,0002,699,264
4Apr 28, 2026 18:488,547256,432,176584,591,00048,965,0002,662,400
5Apr 28, 2026 18:488,703261,117,541596,196,00049,932,0002,666,496
6Apr 28, 2026 18:488,811264,357,893578,407,00050,947,0002,461,696
7Apr 28, 2026 18:489,016270,498,814624,484,00052,956,0002,793,472
8Apr 28, 2026 18:489,021270,646,370636,206,00041,013,0002,658,304
9Apr 28, 2026 18:489,091272,754,220627,296,00052,940,0002,625,536