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 23:16Victor MerckléVictor MerckléScore: 6,976Success
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 23:206,94665,328,67256,652,0001,005,0002,113,536
2May 15, 2026 23:206,94967,198,06956,663,0001,016,0002,113,536
3May 15, 2026 23:206,95165,676,61457,699,00002,113,536
4May 15, 2026 23:206,95266,783,07657,704,00002,113,536
5May 15, 2026 23:206,97667,566,78556,870,0001,036,0002,113,536
6May 15, 2026 23:207,00365,419,12757,085,0001,042,0002,113,536
7May 15, 2026 23:207,00465,454,75757,101,0001,036,0002,113,536
8May 15, 2026 23:207,01065,477,91358,184,00002,113,536
9May 15, 2026 23:207,02167,820,33057,272,0001,008,0002,113,536