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 23, 2026 10:16Kevin HeaveyKevin HeaveyScore: 3,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 10:213,22336,724,68225,569,0001,182,0002,113,536
2Sep 23, 2026 10:213,22936,715,52125,650,0001,152,0002,113,536
3Sep 23, 2026 10:213,23436,784,92225,797,0001,052,0002,113,536
4Sep 23, 2026 10:213,23436,915,76225,782,0001,067,0002,113,536
5Sep 23, 2026 10:213,23637,087,87725,841,0001,022,0002,113,536
6Sep 23, 2026 10:213,24136,692,41325,830,0001,072,0002,113,536
7Sep 23, 2026 10:213,25536,140,17925,795,0001,227,0002,113,536
8Sep 23, 2026 10:213,28137,226,14926,215,0001,020,0002,113,536
9Sep 23, 2026 10:213,28737,299,26126,205,0001,081,0002,113,536