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 listSep 1, 2026 09:25Victor MerckléVictor MerckléScore: 1,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 09:261,72751,824,893123,344,0002,014,0002,170,880stderr
2Sep 1, 2026 09:261,73552,061,595124,031,0002,033,0002,170,880stderr
3Sep 1, 2026 09:261,75552,667,948125,288,0001,036,0002,170,880stderr
4Sep 1, 2026 09:261,75652,695,647124,033,0002,034,0002,170,880stderr
5Sep 1, 2026 09:261,75752,720,313125,724,0002,047,0002,170,880stderr
6Sep 1, 2026 09:261,76252,868,072125,263,0001,027,0002,170,880stderr
7Sep 1, 2026 09:261,77153,130,133125,234,0001,006,0002,154,496stderr
8Sep 1, 2026 09:261,77553,277,023123,894,0001,050,0002,170,880stderr
9Sep 1, 2026 09:261,79053,724,085125,896,0001,075,0002,170,880stderr