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 listFeb 18, 2026 20:04wnwnScore: 7,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:046,15069,835,92648,041,0003,002,0002,351,104
2Feb 18, 2026 20:046,17174,993,41349,209,0002,008,0002,527,232
3Feb 18, 2026 20:046,27378,832,78049,066,0003,004,0002,490,368
4Feb 18, 2026 20:047,12780,628,55457,148,0002,005,0002,473,984
5Feb 18, 2026 20:047,16384,821,49558,449,0001,007,0002,334,720
6Feb 18, 2026 20:047,24483,375,52356,120,0004,008,0002,461,696
7Feb 18, 2026 20:047,29185,028,03158,499,0002,017,0002,379,776
8Feb 18, 2026 20:047,34079,909,44256,930,0003,995,0002,428,928
9Feb 18, 2026 20:047,45388,407,03758,870,0002,993,0002,453,504