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:21Victor MerckléVictor MerckléScore: 2,969Success
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:222,92287,675,309234,534,0003,006,0002,658,304
2Jun 26, 2026 03:222,94488,333,311236,056,0003,061,0002,658,304
3Jun 26, 2026 03:222,94688,386,229236,824,0003,156,0002,658,304
4Jun 26, 2026 03:222,96688,994,554240,993,0001,017,0002,658,304
5Jun 26, 2026 03:222,96989,072,454238,134,0003,103,0002,658,304
6Jun 26, 2026 03:222,98289,465,728239,418,0003,100,0002,658,304
7Jun 26, 2026 03:222,98689,601,213239,633,0003,086,0002,654,208
8Jun 26, 2026 03:223,03391,016,881240,262,0003,037,0002,658,304
9Jun 26, 2026 03:223,04591,379,302240,332,0003,040,0002,654,208