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 04:25Andrew EpsteinAndrew EpsteinScore: 1,598Success
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 04:291,59347,797,288104,468,0002,070,0002,174,976
2Oct 31, 2026 04:291,59347,794,180104,974,0002,079,0002,170,880
3Oct 31, 2026 04:291,59447,837,291104,461,0002,085,0002,170,880
4Oct 31, 2026 04:291,59547,873,041104,988,0002,057,0002,170,880
5Oct 31, 2026 04:291,59847,951,536104,665,0002,098,0002,174,976
6Oct 31, 2026 04:291,59947,980,567104,444,0002,054,0002,174,976
7Oct 31, 2026 04:291,61248,367,001106,682,0001,067,0002,170,880
8Oct 31, 2026 04:291,63449,021,560108,302,0002,072,0002,170,880
9Oct 31, 2026 04:291,64249,284,950108,843,0002,064,0002,170,880