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 listJul 3, 2026 17:09Josu San MartinJosu San MartinScore: 60,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:0959,629504,502,016493,874,0001,051,0002,113,536
2Jul 3, 2026 17:0959,641504,822,690493,969,0001,052,0002,113,536
3Jul 3, 2026 17:0959,891506,615,106496,004,0001,096,0002,113,536
4Jul 3, 2026 17:0960,464511,754,989500,742,0001,117,0002,113,536
5Jul 3, 2026 17:0960,520511,721,133501,317,0001,002,0002,113,536
6Jul 3, 2026 17:0960,567512,355,241501,658,0001,049,0002,113,536
7Jul 3, 2026 17:0960,580512,112,453501,785,0001,034,0002,113,536
8Jul 3, 2026 17:0960,582512,333,889501,792,0001,046,0002,113,536
9Jul 3, 2026 17:0960,589512,694,165501,836,0001,055,0002,113,536