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 29, 2026 01:37Victor MerckléVictor MerckléScore: 3,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:393,01690,480,885234,869,0003,229,0002,707,456
2Jun 29, 2026 01:393,03390,997,412233,756,0003,307,0002,703,360
3Jun 29, 2026 01:393,03991,189,296232,550,0003,325,0002,703,360
4Jun 29, 2026 01:393,06491,949,211232,408,0003,241,0002,707,456
5Jun 29, 2026 01:393,08392,498,070234,284,0004,559,0002,703,360
6Jun 29, 2026 01:393,09492,832,897234,836,0003,304,0002,703,360
7Jun 29, 2026 01:393,09992,984,698234,835,0003,254,0002,707,456
8Jun 29, 2026 01:393,11993,570,871236,123,0003,346,0002,707,456
9Jun 29, 2026 01:393,15194,555,620233,601,0004,500,0002,703,360