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 8, 2026 01:17Victor MerckléVictor MerckléScore: 3,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:192,92487,736,988232,158,0003,104,0002,711,552stderr
2Jul 8, 2026 01:192,95388,595,177233,719,0003,298,0002,711,552stderr
3Jul 8, 2026 01:192,96789,022,823231,481,0004,232,0002,711,552stderr
4Jul 8, 2026 01:193,01990,584,552234,837,0003,153,0002,707,456stderr
5Jul 8, 2026 01:193,04391,309,666234,061,0003,267,0002,711,552stderr
6Jul 8, 2026 01:193,05191,535,722235,032,0003,224,0002,711,552stderr
7Jul 8, 2026 01:193,06892,047,366235,803,0003,198,0002,711,552stderr
8Jul 8, 2026 01:193,07292,160,620236,366,0003,285,0002,707,456stderr
9Jul 8, 2026 01:193,07392,193,022234,504,0003,174,0002,711,552stderr