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 listJul 3, 2026 04:43Victor MerckléVictor MerckléScore: 2,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 04:442,84985,478,679227,158,0003,085,0002,662,400stderr
2Jul 3, 2026 04:442,89586,868,316233,835,0001,037,0002,662,400stderr
3Jul 3, 2026 04:442,91087,318,694233,465,0003,124,0002,658,304stderr
4Jul 3, 2026 04:442,92087,603,578234,237,0003,095,0002,420,736stderr
5Jul 3, 2026 04:442,92987,877,502233,456,0003,130,0002,662,400stderr
6Jul 3, 2026 04:442,93988,170,548234,313,0003,133,0002,662,400stderr
7Jul 3, 2026 04:442,94988,485,960230,267,0003,137,0002,662,400stderr
8Jul 3, 2026 04:442,97089,113,582233,592,0003,272,0002,658,304stderr
9Jul 3, 2026 04:443,00590,161,506236,445,0003,132,0002,662,400stderr