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 11, 2026 14:46Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:47093,387,658243,700,0003,025,0002,654,208expected "1022887 ", got "1022886 "
2Jun 11, 2026 14:473,10193,033,513242,418,0003,148,0002,650,112
3Jun 11, 2026 14:473,10593,154,028243,902,0003,057,0002,654,208
4Jun 11, 2026 14:473,10893,246,682242,550,0003,204,0002,654,208
5Jun 11, 2026 14:473,12093,612,524245,420,0001,020,0002,654,208
6Jun 11, 2026 14:473,12693,792,291244,273,0003,057,0002,654,208
7Jun 11, 2026 14:473,13193,944,120244,648,0003,211,0002,654,208
8Jun 11, 2026 14:473,14094,211,616247,009,0001,032,0002,396,160
9Jun 11, 2026 14:473,15094,507,332246,825,0003,195,0002,650,112