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 listMay 11, 2026 20:48Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:48043,531,38735,163,0001,090,0002,113,536expected "53677550878012510 ", got "53677550622012510 "
2May 11, 2026 20:484,30744,607,71934,711,0001,042,0002,113,536
3May 11, 2026 20:484,31745,479,38234,763,0001,070,0002,113,536
4May 11, 2026 20:484,32045,311,48734,778,0001,079,0002,113,536
5May 11, 2026 20:484,32043,467,36034,780,0001,083,0002,113,536
6May 11, 2026 20:484,32344,783,80034,808,0001,077,0002,113,536
7May 11, 2026 20:484,33044,866,82434,870,0001,069,0002,113,536
8May 11, 2026 20:484,34446,337,75735,010,0001,050,0002,113,536
9May 11, 2026 20:484,40345,684,98635,477,0001,071,0002,113,536