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 listOct 31, 2026 09:57Andrew EpsteinAndrew EpsteinScore: 1,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 10:061,53546,065,349100,162,0002,002,0002,179,072stderr
2Oct 31, 2026 10:061,54646,382,765100,882,0002,021,0002,183,168stderr
3Oct 31, 2026 10:061,54746,421,229100,740,0002,075,0002,179,072stderr
4Oct 31, 2026 10:061,54846,468,309100,991,0002,024,0002,183,168stderr
5Oct 31, 2026 10:061,55446,622,030101,566,0002,008,0002,179,072stderr
6Oct 31, 2026 10:061,55646,681,710101,896,0002,043,0002,179,072stderr
7Oct 31, 2026 10:061,55646,684,759103,293,0001,010,0002,179,072stderr
8Oct 31, 2026 10:061,56146,832,920102,382,0002,019,0002,179,072stderr
9Oct 31, 2026 10:062,11663,508,166115,685,0002,138,0002,179,072stderr