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 listAug 15, 2026 22:33Victor MerckléVictor MerckléScore: 4,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:394,561136,842,924375,452,0005,178,0002,617,344stderr
2Aug 15, 2026 22:394,629138,898,982374,965,0005,369,0002,695,168stderr
3Aug 15, 2026 22:394,648139,461,484381,278,0005,383,0002,617,344stderr
4Aug 15, 2026 22:394,680140,412,631386,034,0005,406,0002,695,168stderr
5Aug 15, 2026 22:394,684140,549,604384,883,0005,220,0002,654,208stderr
6Aug 15, 2026 22:394,699140,976,284384,772,0006,144,0002,654,208stderr
7Aug 15, 2026 22:394,703141,102,960387,622,0005,188,0002,613,248stderr
8Aug 15, 2026 22:394,704141,143,195386,661,0005,398,0002,658,304stderr
9Aug 15, 2026 22:394,795143,853,891378,881,0005,439,0002,695,168stderr