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 07:11Andrew 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 07:191,54846,446,508101,550,0002,003,0002,183,168stderr
2Oct 31, 2026 07:191,54946,499,002101,429,0002,026,0002,179,072stderr
3Oct 31, 2026 07:191,55646,689,270102,015,0002,038,0002,179,072stderr
4Oct 31, 2026 07:191,55846,767,356101,905,0002,036,0002,179,072stderr
5Oct 31, 2026 07:191,56346,903,872101,228,0002,023,0002,179,072stderr
6Oct 31, 2026 07:191,56346,895,767102,384,0002,034,0002,183,168stderr
7Oct 31, 2026 07:191,57847,349,581105,033,0001,010,0002,179,072stderr
8Oct 31, 2026 07:191,58247,465,641104,234,0002,013,0002,179,072stderr
9Oct 31, 2026 07:191,58447,528,053105,811,0001,010,0002,183,168stderr