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 30, 2026 01:33Victor MerckléVictor MerckléScore: 3,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 01:373,02390,707,679233,556,0003,399,0002,674,688
2Jun 30, 2026 01:373,02890,858,586234,037,0003,627,0002,678,784
3Jun 30, 2026 01:373,04691,387,837235,464,0003,632,0002,674,688
4Jun 30, 2026 01:373,05191,535,173237,091,0003,678,0002,674,688
5Jun 30, 2026 01:373,05691,705,524236,451,0003,705,0002,740,224
6Jun 30, 2026 01:373,06992,094,016237,482,0003,665,0002,674,688
7Jun 30, 2026 01:373,07092,101,891238,832,0003,670,0002,674,688
8Jun 30, 2026 01:373,07292,177,132238,475,0003,501,0002,678,784
9Jun 30, 2026 01:373,08592,563,815239,315,0003,426,0002,678,784