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 listNov 8, 2026 09:53SlashedRibbonWilledSlashedRibbonWilledScore: 89,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 09:5489,033749,760,534680,138,00058,839,0002,113,536
2Nov 8, 2026 09:5489,037749,751,145679,789,00059,225,0002,113,536
3Nov 8, 2026 09:5489,111750,399,353680,131,00059,498,0002,113,536