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 23:36Victor MerckléVictor MerckléScore: 3,052Success
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 23:393,00990,294,219232,896,0003,385,0002,674,688
2Jul 7, 2026 23:393,01190,336,741232,191,0003,424,0002,674,688
3Jul 7, 2026 23:393,02290,668,548233,057,0003,111,0002,674,688
4Jul 7, 2026 23:393,05291,563,716235,685,0003,686,0002,674,688
5Jul 7, 2026 23:393,05291,561,164235,726,0003,653,0002,674,688
6Jul 7, 2026 23:393,06992,099,542236,761,0003,507,0002,674,688
7Jul 7, 2026 23:393,07892,353,284238,630,0003,707,0002,670,592
8Jul 7, 2026 23:393,08192,437,670238,415,0003,693,0002,674,688
9Jul 7, 2026 23:393,09592,866,325239,324,0003,647,0002,674,688