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 20, 2026 10:35M-RochatM-RochatScore: 6,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:356,72365,440,90653,745,0002,059,0002,113,536
2May 20, 2026 10:356,74167,532,56853,906,0002,047,0002,113,536
3May 20, 2026 10:356,74766,608,97553,950,0002,052,0002,113,536
4May 20, 2026 10:356,74865,487,32153,919,0002,097,0002,113,536
5May 20, 2026 10:356,75466,631,71653,980,0002,081,0002,113,536
6May 20, 2026 10:356,77065,828,98454,112,0002,081,0002,113,536
7May 20, 2026 10:356,85168,330,40554,716,0002,151,0002,113,536
8May 20, 2026 10:356,85866,680,51854,710,0002,213,0002,113,536
9May 20, 2026 10:356,86567,173,15354,810,0002,170,0002,113,536