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 10:38Andrew EpsteinAndrew EpsteinScore: 1,545Success
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 10:451,53145,949,08899,751,0001,345,0002,187,264stderr
2Oct 31, 2026 10:451,54246,270,838100,101,0001,344,0002,187,264stderr
3Oct 31, 2026 10:451,54446,340,258100,924,0001,380,0002,191,360stderr
4Oct 31, 2026 10:451,54446,331,545100,896,0001,348,0002,187,264stderr
5Oct 31, 2026 10:451,54546,378,351101,106,0001,380,0002,187,264stderr
6Oct 31, 2026 10:451,55046,511,987101,584,0001,374,0002,187,264stderr
7Oct 31, 2026 10:451,57347,205,287101,600,0001,378,0002,191,360stderr
8Oct 31, 2026 10:451,62048,610,513103,224,0001,365,0002,187,264stderr
9Oct 31, 2026 10:451,63348,999,843104,171,0001,370,0002,187,264stderr