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 3, 2026 11:47boop34boop34Score: 37,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 11:4836,889316,359,632204,675,000101,504,0002,113,536
2Sep 3, 2026 11:4837,054317,737,723204,972,000102,577,0002,113,536
3Sep 3, 2026 11:4837,152318,481,781204,685,000103,679,0002,113,536
4Sep 3, 2026 11:4837,180318,722,765204,714,000103,883,0002,113,536
5Sep 3, 2026 11:4837,186318,949,515204,647,000103,999,0002,113,536
6Sep 3, 2026 11:4837,227319,116,036204,822,000104,164,0002,113,536
7Sep 3, 2026 11:4837,285319,747,152205,125,000104,341,0002,113,536
8Sep 3, 2026 11:4837,373320,449,045205,702,000104,499,0002,113,536
9Sep 3, 2026 11:4837,454321,249,920206,135,000104,734,0002,113,536