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 listSep 24, 2025 13:32Daniel MastalerzDaniel MastalerzScore: 69,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2025 13:3269,587608,559,593517,616,00059,955,0002,396,160
2Sep 24, 2025 13:3269,620602,724,384521,862,00055,985,0002,256,896
3Sep 24, 2025 13:3269,634602,549,765517,966,00059,996,0002,260,992
4Sep 24, 2025 13:3269,635601,803,093521,971,00055,996,0002,260,992
5Sep 24, 2025 13:3269,635597,304,712524,973,00052,997,0002,519,040
6Sep 24, 2025 13:3269,637602,532,940518,987,00058,998,0002,256,896
7Sep 24, 2025 13:3269,651603,676,252524,093,00054,009,0002,383,872
8Sep 24, 2025 13:3269,697604,113,016522,442,00056,047,0002,260,992
9Sep 24, 2025 13:3269,703605,812,261515,589,00062,949,0002,383,872