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 27, 2026 07:55Victor MerckléVictor MerckléScore: 3,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 07:572,89886,956,187230,788,0003,289,0002,707,456
2Jun 27, 2026 07:572,94688,402,581234,072,0003,321,0002,703,360
3Jun 27, 2026 07:572,96388,908,448231,827,0003,328,0002,703,360
4Jun 27, 2026 07:572,98089,409,590232,431,0003,320,0002,707,456
5Jun 27, 2026 07:573,00090,027,100234,240,0003,184,0002,707,456
6Jun 27, 2026 07:573,00290,074,296235,184,0003,234,0002,707,456
7Jun 27, 2026 07:573,03491,047,814234,382,0003,309,0002,703,360
8Jun 27, 2026 07:573,06291,864,034235,015,0003,115,0002,707,456
9Jun 27, 2026 07:573,14894,463,107240,932,0003,348,0002,707,456