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 06:40marko1597marko1597Score: 25,017Success
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 06:4124,841745,250,430730,581,0006,336,0002,121,728stderr
2Aug 17, 2026 06:4124,957748,714,566733,973,0006,303,0002,121,728stderr
3Aug 17, 2026 06:4124,967749,034,780734,319,0006,285,0002,121,728stderr
4Aug 17, 2026 06:4124,967749,019,520733,687,0006,178,0002,121,728stderr
5Aug 17, 2026 06:4125,017750,517,042735,044,0006,327,0002,121,728stderr
6Aug 17, 2026 06:4125,048751,456,228735,957,0006,309,0002,121,728stderr
7Aug 17, 2026 06:4125,079752,398,733737,586,0006,282,0002,121,728stderr
8Aug 17, 2026 06:4125,259757,772,246734,945,0007,085,0002,121,728stderr
9Aug 17, 2026 06:4125,345760,376,244745,556,0006,297,0002,121,728stderr