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 listOct 31, 2026 09:34Andrew EpsteinAndrew EpsteinScore: 1,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 09:421,51345,396,65297,967,0002,022,0002,191,360stderr
2Oct 31, 2026 09:421,51845,543,16399,558,0001,008,0002,179,072stderr
3Oct 31, 2026 09:421,54346,293,436102,024,0001,009,0002,179,072stderr
4Oct 31, 2026 09:421,54646,402,904100,996,0002,039,0002,179,072stderr
5Oct 31, 2026 09:421,54846,442,767101,144,0002,012,0002,179,072stderr
6Oct 31, 2026 09:421,55146,554,354101,678,0002,042,0002,183,168stderr
7Oct 31, 2026 09:421,56146,832,638102,467,0002,036,0002,183,168stderr
8Oct 31, 2026 09:421,57647,306,914104,968,0001,017,0002,179,072stderr
9Oct 31, 2026 09:421,59647,891,890100,392,0002,052,0002,224,128stderr