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 17, 2026 09:15eeby jeebyeeby jeebyScore: 64,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 09:1564,545545,929,619477,395,00058,329,0002,113,536
2Sep 17, 2026 09:1564,592546,294,653477,591,00058,526,0002,113,536
3Sep 17, 2026 09:1564,616546,669,874477,562,00058,755,0002,113,536
4Sep 17, 2026 09:1564,631547,426,145477,556,00058,887,0002,113,536
5Sep 17, 2026 09:1564,634546,674,178477,357,00059,112,0002,113,536
6Sep 17, 2026 09:1564,657546,901,752477,633,00059,027,0002,113,536
7Sep 17, 2026 09:1564,661547,013,285477,091,00059,598,0002,113,536
8Sep 17, 2026 09:1564,670547,037,083477,613,00059,154,0002,113,536
9Sep 17, 2026 09:1564,712547,316,597477,480,00059,635,0002,113,536