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 14, 2026 00:32drewbumpasdrewbumpasScore: 75,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:3275,009632,828,277621,496,0001,083,0002,113,536
2Sep 14, 2026 00:3275,330635,389,298624,235,0001,012,0002,113,536
3Sep 14, 2026 00:3275,342635,543,850624,321,0001,024,0002,113,536
4Sep 14, 2026 00:3275,349635,715,124624,313,0001,089,0002,113,536
5Sep 14, 2026 00:3275,374635,904,428624,406,0001,201,0002,113,536
6Sep 14, 2026 00:3275,399635,977,752624,729,0001,086,0002,113,536
7Sep 14, 2026 00:3275,405636,170,306624,867,0001,002,0002,113,536
8Sep 14, 2026 00:3276,628646,300,533634,879,0001,137,0002,113,536
9Sep 14, 2026 00:3276,638646,280,105635,090,0001,010,0002,113,536