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 19, 2026 21:17Pavel KrajcevskiPavel KrajcevskiScore: 88,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:1788,929747,562,795679,980,00058,138,0002,113,536
2May 19, 2026 21:1788,944748,489,596680,000,00058,242,0002,113,536
3May 19, 2026 21:1788,972747,959,131679,969,00058,499,0002,113,536
4May 19, 2026 21:1788,975749,269,664680,017,00058,476,0002,113,536
5May 19, 2026 21:1788,983747,766,665680,032,00058,535,0002,113,536
6May 19, 2026 21:1789,000750,922,638680,198,00058,510,0002,113,536
7May 19, 2026 21:1789,011751,011,309679,161,00059,632,0002,113,536
8May 19, 2026 21:1789,026751,727,956680,128,00058,792,0002,113,536
9May 19, 2026 21:1789,049748,303,693680,032,00059,082,0002,113,536