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 5, 2026 12:45wnwnScore: 3,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:473,29535,797,98026,325,0001,029,0002,113,536
2Sep 5, 2026 12:473,31235,682,04026,358,0001,133,0002,113,536
3Sep 5, 2026 12:473,31435,979,79626,504,0001,009,0002,113,536
4Sep 5, 2026 12:473,35136,245,93726,742,0001,074,0002,113,536
5Sep 5, 2026 12:473,36336,414,75826,887,0001,033,0002,113,536
6Sep 5, 2026 12:473,44637,045,69827,593,0001,010,0002,113,536
7Sep 5, 2026 12:473,45137,044,55327,641,0001,007,0002,113,536
8Sep 5, 2026 12:473,47237,982,09327,820,0001,005,0002,113,536
9Sep 5, 2026 12:473,50238,210,66128,070,0001,003,0002,113,536