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 6, 2026 13:36Victor MerckléVictor MerckléScore: 4,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 13:384,498134,966,962370,582,0004,450,0002,646,016
2Jun 6, 2026 13:384,510135,301,322370,910,0004,453,0002,646,016
3Jun 6, 2026 13:384,549136,485,448375,755,0004,470,0002,646,016
4Jun 6, 2026 13:384,594137,843,059375,659,0004,540,0002,650,112
5Jun 6, 2026 13:384,602138,082,330380,056,0003,235,0002,650,112
6Jun 6, 2026 13:384,604138,131,839377,652,0004,427,0002,641,920
7Jun 6, 2026 13:384,630138,916,814381,951,0003,543,0002,650,112
8Jun 6, 2026 13:384,635139,053,712381,178,0003,222,0002,650,112
9Jun 6, 2026 13:384,752142,578,069381,909,0003,115,0002,650,112