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 26, 2026 03:06Victor MerckléVictor MerckléScore: 2,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 03:072,84185,255,369230,134,0001,032,0002,658,304
2Jun 26, 2026 03:072,84585,356,501228,456,0003,137,0002,658,304
3Jun 26, 2026 03:072,84985,489,903228,990,0003,059,0002,654,208
4Jun 26, 2026 03:072,85185,543,198229,006,0003,087,0002,658,304
5Jun 26, 2026 03:072,87286,174,402230,666,0003,208,0002,658,304
6Jun 26, 2026 03:072,89086,724,876230,684,0003,078,0002,658,304
7Jun 26, 2026 03:072,89086,710,704232,325,0003,158,0002,658,304
8Jun 26, 2026 03:072,91887,561,682230,542,0003,127,0002,658,304
9Jun 26, 2026 03:072,96588,966,963233,141,0003,089,0002,654,208