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 7, 2026 22:40Victor MerckléVictor MerckléScore: 3,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:422,95188,536,479231,835,0003,213,0002,711,552stderr
2Jul 7, 2026 22:422,97589,261,553232,297,0003,185,0002,711,552stderr
3Jul 7, 2026 22:422,98189,447,752232,758,0003,229,0002,711,552stderr
4Jul 7, 2026 22:422,98689,589,914233,531,0003,190,0002,461,696stderr
5Jul 7, 2026 22:423,00990,288,866234,194,0003,271,0002,711,552stderr
6Jul 7, 2026 22:423,01690,485,141232,189,0003,207,0002,707,456stderr
7Jul 7, 2026 22:423,06191,858,585234,824,0003,134,0002,711,552stderr
8Jul 7, 2026 22:423,06792,038,797235,323,0003,246,0002,711,552stderr
9Jul 7, 2026 22:423,14894,465,308234,173,0004,653,0002,707,456stderr