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 listAug 17, 2026 04:51marko1597marko1597Score: 9,679Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:179,565286,953,950266,830,00011,719,0002,121,728stderr
2Aug 17, 2026 05:179,576287,294,844267,010,00011,901,0002,121,728stderr
3Aug 17, 2026 05:179,612288,384,578268,322,00011,635,0002,121,728stderr
4Aug 17, 2026 05:179,624288,735,940268,547,00011,751,0002,121,728stderr
5Aug 17, 2026 05:179,679290,380,555270,167,00011,951,0002,121,728stderr
6Aug 17, 2026 05:179,700291,014,802269,170,00012,034,0002,121,728stderr
7Aug 17, 2026 05:179,715291,456,204271,231,00011,935,0002,121,728stderr
8Aug 17, 2026 05:179,728291,857,001271,776,00011,741,0002,121,728stderr
9Aug 17, 2026 05:179,740292,224,369272,113,00011,683,0002,121,728stderr