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 19, 2026 01:00Victor MerckléVictor MerckléScore: 3,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 01:013,07492,226,389242,394,0002,014,0002,650,112
2Jun 19, 2026 01:013,09992,983,266244,700,0001,015,0002,654,208
3Jun 19, 2026 01:013,10293,064,244242,164,0003,091,0002,654,208
4Jun 19, 2026 01:013,12393,702,155246,027,0001,027,0002,650,112
5Jun 19, 2026 01:013,17795,328,747244,478,0003,109,0002,654,208
6Jun 19, 2026 01:013,18295,482,002244,627,0003,022,0002,654,208
7Jun 19, 2026 01:013,18895,646,513248,751,0003,123,0002,654,208
8Jun 19, 2026 01:013,19895,960,297252,494,00002,654,208
9Jun 19, 2026 01:013,22796,813,184248,635,0002,012,0002,654,208