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 11, 2026 07:23wnwnScore: 3,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:243,45038,923,01128,643,00002,113,536
2May 11, 2026 07:243,48541,563,03928,929,00002,113,536
3May 11, 2026 07:243,49639,047,38829,020,00002,113,536
4May 11, 2026 07:243,49938,941,43229,047,00002,113,536
5May 11, 2026 07:243,51238,641,98529,157,00002,113,536
6May 11, 2026 07:243,51336,651,59629,161,00002,113,536
7May 11, 2026 07:243,51437,957,90429,168,00002,113,536
8May 11, 2026 07:243,51638,189,59929,189,00002,113,536
9May 11, 2026 07:243,51936,743,69229,214,00002,113,536