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:52Andrew EpsteinAndrew EpsteinScore: 1,599Success
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:591,56246,863,561101,261,0003,112,0002,179,072stderr
2Oct 31, 2026 04:591,57147,134,352101,736,0003,079,0002,179,072stderr
3Oct 31, 2026 04:591,58047,402,460102,527,0003,088,0002,179,072stderr
4Oct 31, 2026 04:591,59147,743,751103,829,0003,087,0002,179,072stderr
5Oct 31, 2026 04:591,59947,984,951104,500,0003,072,0002,179,072stderr
6Oct 31, 2026 04:591,61248,383,360105,328,0003,160,0002,179,072stderr
7Oct 31, 2026 04:591,61248,376,917105,668,0003,085,0002,179,072stderr
8Oct 31, 2026 04:591,63549,050,502107,585,0003,078,0002,179,072stderr
9Oct 31, 2026 04:591,66750,015,659110,073,0003,077,0002,179,072stderr