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 listSep 29, 2026 09:54wnwnScore: 3,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:543,27936,080,48627,223,000020,480
2Sep 29, 2026 09:543,28036,059,04327,226,000020,480
3Sep 29, 2026 09:543,28536,210,12627,269,000020,480
4Sep 29, 2026 09:543,28636,200,01827,279,000020,480
5Sep 29, 2026 09:543,28636,179,63927,274,000020,480
6Sep 29, 2026 09:543,28836,189,35627,298,000020,480
7Sep 29, 2026 09:543,29036,171,56327,312,000020,480
8Sep 29, 2026 09:543,30436,313,07726,409,0001,015,00020,480
9Sep 29, 2026 09:543,40737,167,55028,281,000020,480