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 08:15Andrew EpsteinAndrew EpsteinScore: 1,482Success
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 08:221,45743,724,83399,571,0001,200,0002,170,880stderr
2Oct 31, 2026 08:221,45943,795,18399,648,0001,132,0002,170,880stderr
3Oct 31, 2026 08:221,47544,267,165101,021,0001,178,0002,170,880stderr
4Oct 31, 2026 08:221,47644,280,145101,911,0001,106,0002,162,688stderr
5Oct 31, 2026 08:221,48244,482,159101,968,0001,076,0002,170,880stderr
6Oct 31, 2026 08:221,48644,591,980102,177,0001,071,0002,170,880stderr
7Oct 31, 2026 08:221,49044,713,725102,565,0001,208,0002,170,880stderr
8Oct 31, 2026 08:221,49244,786,530102,657,0001,128,0002,170,880stderr
9Oct 31, 2026 08:221,49844,951,080103,501,0001,131,0002,170,880stderr