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:02Victor MerckléVictor MerckléScore: 6,841Success
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:046,682200,482,587483,799,00049,979,0002,723,840
2Apr 28, 2026 17:046,692200,768,326486,234,00048,923,0002,711,552
3Apr 28, 2026 17:046,787203,620,527477,544,00057,944,0002,752,512
4Apr 28, 2026 17:046,830204,922,843487,053,00048,005,0002,977,792
5Apr 28, 2026 17:046,841205,250,845482,055,00048,005,0002,703,360
6Apr 28, 2026 17:046,846205,390,805476,621,00037,890,0002,695,168
7Apr 28, 2026 17:046,874206,233,105492,101,00040,008,0002,625,536
8Apr 28, 2026 17:046,915207,473,542487,032,00047,003,0002,723,840
9Apr 28, 2026 17:046,950208,512,973479,036,00042,003,0002,752,512