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:00Andrew EpsteinAndrew EpsteinScore: 1,563Success
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:071,54346,317,883100,722,0002,077,0002,174,976
2Oct 31, 2026 08:071,54646,406,572100,749,0002,072,0002,179,072
3Oct 31, 2026 08:071,55746,718,249101,720,0002,004,0002,220,032
4Oct 31, 2026 08:071,56146,834,231102,155,0002,079,0002,174,976
5Oct 31, 2026 08:071,56346,915,311102,252,0002,023,0002,174,976
6Oct 31, 2026 08:071,56947,082,021102,503,0002,002,0002,174,976
7Oct 31, 2026 08:071,58147,440,555103,962,0002,009,0002,174,976
8Oct 31, 2026 08:071,58947,677,529102,798,0002,010,0002,174,976
9Oct 31, 2026 08:071,60548,172,947102,607,0001,010,0002,179,072