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:54Andrew EpsteinAndrew EpsteinScore: 1,462Success
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:591,44343,306,32599,024,0001,011,0002,170,880stderr
2Oct 31, 2026 09:591,44543,375,69499,259,0001,160,0002,170,880stderr
3Oct 31, 2026 09:591,45243,563,40198,570,0002,027,0002,170,880stderr
4Oct 31, 2026 09:591,45743,731,201100,342,0001,016,0002,170,880stderr
5Oct 31, 2026 09:591,46243,867,046100,718,0001,150,0002,162,688stderr
6Oct 31, 2026 09:591,47144,139,508101,235,0001,207,0002,162,688stderr
7Oct 31, 2026 09:591,47144,142,243100,557,0002,172,0002,170,880stderr
8Oct 31, 2026 09:591,47344,194,989101,722,0001,012,0002,170,880stderr
9Oct 31, 2026 09:591,51245,387,066105,122,0001,176,0002,170,880stderr