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:48Josu San MartinJosu San MartinScore: 4,668Success
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:564,642139,272,965197,211,0004,106,0002,146,304
2Aug 18, 2026 03:564,651139,540,488198,004,0003,053,0002,146,304
3Aug 18, 2026 03:564,654139,645,026197,042,0004,125,0002,146,304
4Aug 18, 2026 03:564,654139,642,245198,505,0003,110,0002,146,304
5Aug 18, 2026 03:564,668140,058,737198,003,0004,094,0002,146,304
6Aug 18, 2026 03:564,672140,187,295197,375,0004,107,0002,146,304
7Aug 18, 2026 03:564,684140,543,015198,285,0003,100,0002,146,304
8Aug 18, 2026 03:564,721141,654,532199,465,0004,195,0002,142,208
9Aug 18, 2026 03:564,729141,870,621197,444,0004,108,0002,146,304