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:54Victor MerckléVictor MerckléScore: 4,656Success
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 23:004,566136,984,801378,400,0003,117,0002,654,208stderr
2Aug 15, 2026 23:004,605138,167,570378,972,0003,125,0002,650,112stderr
3Aug 15, 2026 23:004,607138,234,391379,662,0003,162,0002,617,344stderr
4Aug 15, 2026 23:004,637139,127,886383,115,0003,164,0002,658,304stderr
5Aug 15, 2026 23:004,656139,703,712385,759,0003,173,0002,695,168stderr
6Aug 15, 2026 23:004,670140,102,888387,305,0003,122,0002,654,208stderr
7Aug 15, 2026 23:004,682140,478,645386,337,0003,221,0002,695,168stderr
8Aug 15, 2026 23:004,710141,317,726387,426,0003,175,0002,613,248stderr
9Aug 15, 2026 23:004,725141,776,064390,735,0003,153,0002,695,168stderr