Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 11, 2026 20:31Daniel MastalerzDaniel MastalerzScore: 6,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 20:315,91271,217,48746,068,0003,004,0002,412,544
2Mar 11, 2026 20:315,96671,815,31147,499,0002,021,0002,285,568
3Mar 11, 2026 20:315,98973,880,29649,712,00002,285,568
4Mar 11, 2026 20:316,01370,648,35347,911,0001,996,0002,285,568
5Mar 11, 2026 20:316,02771,661,58048,025,0002,001,0002,281,472
6Mar 11, 2026 20:316,03873,971,19347,108,0003,006,0002,289,664