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 18, 2026 03:30Josu San MartinJosu San MartinScore: 4,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:344,647139,412,030197,714,0003,028,0002,146,304
2Aug 18, 2026 03:344,663139,911,596197,945,0003,106,0002,146,304
3Aug 18, 2026 03:344,670140,125,254197,721,0004,149,0002,146,304
4Aug 18, 2026 03:344,671140,152,699200,282,0002,126,0002,146,304
5Aug 18, 2026 03:344,686140,605,151199,379,0003,091,0002,129,920
6Aug 18, 2026 03:344,717141,525,418198,928,0003,116,0002,146,304
7Aug 18, 2026 03:344,724141,746,838196,537,0004,083,0002,146,304
8Aug 18, 2026 03:344,733141,993,217200,226,0003,090,0002,146,304
9Aug 18, 2026 03:345,902177,084,997234,446,0007,215,0002,125,824