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 24, 2026 04:28Victor MerckléVictor MerckléScore: 3,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 04:293,12093,615,784244,716,0003,139,0002,654,208
2Jun 24, 2026 04:293,16694,982,128247,914,0003,086,0002,412,544
3Jun 24, 2026 04:293,16895,058,770248,506,0003,097,0002,654,208
4Jun 24, 2026 04:293,18895,645,697248,952,0003,082,0002,412,544
5Jun 24, 2026 04:293,32299,689,797265,973,0003,138,0002,654,208
6Jun 24, 2026 04:293,586107,592,916275,067,0001,031,0002,654,208
7Jun 24, 2026 04:293,599107,993,973272,088,0003,172,0002,654,208
8Jun 24, 2026 04:293,634109,044,358288,986,0003,108,0002,654,208
9Jun 24, 2026 04:293,767113,026,583281,049,0003,037,0002,654,208