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 07:29Andrew EpsteinAndrew EpsteinScore: 3,688Success
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 07:303,569107,085,064263,143,0006,248,0002,383,872stderr
2Oct 31, 2026 07:303,581107,459,783263,213,0006,223,0002,367,488stderr
3Oct 31, 2026 07:303,662109,869,029267,682,0006,116,0002,355,200stderr
4Oct 31, 2026 07:303,678110,347,805269,234,0006,250,0002,367,488stderr
5Oct 31, 2026 07:303,688110,648,487269,944,0006,303,0002,371,584stderr
6Oct 31, 2026 07:303,688110,650,732267,752,0006,080,0002,355,200stderr
7Oct 31, 2026 07:303,693110,818,336268,361,0006,139,0002,379,776stderr
8Oct 31, 2026 07:303,701111,033,483269,496,0006,227,0002,355,200stderr
9Oct 31, 2026 07:303,703111,105,830268,578,0006,109,0002,379,776stderr