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 listMay 15, 2026 22:56Victor MerckléVictor MerckléScore: 6,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 22:566,94865,509,52156,667,0001,002,0002,113,536
2May 15, 2026 22:566,94965,848,48257,684,00002,113,536
3May 15, 2026 22:566,95165,045,08756,692,0001,008,0002,113,536
4May 15, 2026 22:566,95268,256,61456,677,0001,030,0002,113,536
5May 15, 2026 22:566,95466,083,17956,696,0001,025,0002,113,536
6May 15, 2026 22:566,95866,251,92356,713,0001,040,0002,113,536
7May 15, 2026 22:566,96065,899,78456,757,0001,013,0002,113,536
8May 15, 2026 22:566,97065,958,16256,746,0001,113,0002,113,536
9May 15, 2026 22:567,01667,773,75157,226,0001,015,0002,113,536