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 9, 2026 22:50Victor MerckléVictor MerckléScore: 3,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 22:513,17295,179,940249,916,0001,005,0002,142,208
2Jun 9, 2026 22:513,18695,588,043249,065,0002,186,0002,142,208
3Jun 9, 2026 22:513,18795,619,483246,952,0002,271,0002,146,304
4Jun 9, 2026 22:513,18995,682,086246,208,0002,186,0002,146,304
5Jun 9, 2026 22:513,19995,975,828251,666,0001,020,0002,142,208
6Jun 9, 2026 22:513,19995,981,937251,805,0001,004,0002,142,208
7Jun 9, 2026 22:513,19995,995,061244,699,0003,348,0002,146,304
8Jun 9, 2026 22:513,20396,103,218252,010,0001,005,0002,142,208
9Jun 9, 2026 22:513,20796,234,025244,897,0002,328,0002,146,304