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 listJun 26, 2026 23:54Victor MerckléVictor MerckléScore: 2,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 23:552,82084,629,025228,180,0001,010,0002,654,208
2Jun 26, 2026 23:552,84685,384,557228,572,0003,110,0002,658,304
3Jun 26, 2026 23:552,84885,451,810230,801,0001,027,0002,658,304
4Jun 26, 2026 23:552,85285,581,676231,233,0001,021,0002,658,304
5Jun 26, 2026 23:552,85685,682,828231,639,0001,015,0002,658,304
6Jun 26, 2026 23:552,86085,821,131228,796,0003,125,0002,658,304
7Jun 26, 2026 23:552,86285,868,649228,577,0003,209,0002,658,304
8Jun 26, 2026 23:552,86986,099,579230,413,0003,056,0002,658,304
9Jun 26, 2026 23:552,93087,926,282233,159,0002,046,0002,658,304