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:05Andrew EpsteinAndrew EpsteinScore: 1,474Success
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:121,44643,404,32198,767,0001,204,0002,150,400stderr
2Oct 31, 2026 08:121,45543,670,10199,290,0001,250,0002,154,496stderr
3Oct 31, 2026 08:121,45943,770,91499,843,0001,188,0002,170,880stderr
4Oct 31, 2026 08:121,47044,110,437101,112,0001,162,0002,154,496stderr
5Oct 31, 2026 08:121,47444,224,645100,722,0001,274,0002,150,400stderr
6Oct 31, 2026 08:121,47544,253,107101,495,0001,041,0002,150,400stderr
7Oct 31, 2026 08:121,47744,332,641101,457,0001,014,0002,170,880stderr
8Oct 31, 2026 08:121,47844,363,423101,687,0001,215,0002,162,688stderr
9Oct 31, 2026 08:121,50745,217,000104,215,0001,200,0002,150,400stderr