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 17, 2026 23:22Victor MerckléVictor MerckléScore: 4,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 23:234,726141,795,838390,778,0001,005,0002,654,208
2Jun 17, 2026 23:234,759142,774,608396,032,0001,017,0002,654,208
3Jun 17, 2026 23:234,816144,507,239393,205,0003,108,0002,654,208
4Jun 17, 2026 23:234,898146,967,299399,386,0003,058,0002,654,208
5Jun 17, 2026 23:234,913147,391,344399,506,0003,149,0002,650,112
6Jun 17, 2026 23:234,919147,584,612400,793,0003,055,0002,654,208
7Jun 17, 2026 23:234,936148,094,842407,482,0001,009,0002,650,112
8Jun 17, 2026 23:234,965148,971,493405,371,0002,060,0002,654,208
9Jun 17, 2026 23:235,018150,561,054404,029,0003,084,0002,654,208