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 listMar 18, 2026 18:36wnwnScore: 4,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 18:284,23660,324,66333,148,0002,009,0002,502,656
2Mar 18, 2026 18:294,23958,294,44733,172,0002,010,0002,527,232
3Mar 18, 2026 18:284,25059,614,20434,270,0001,007,0002,490,368
4Mar 18, 2026 18:294,25355,633,43434,294,0001,008,0002,273,280
5Mar 18, 2026 18:364,25357,048,29533,287,0002,017,0002,494,464
6Mar 18, 2026 18:364,25555,103,26234,306,0001,009,0002,273,280
7Mar 18, 2026 18:284,25759,165,48434,327,0001,009,0002,490,368
8Mar 18, 2026 18:294,25855,043,86034,332,0001,009,0002,494,464
9Mar 18, 2026 18:364,28356,361,77734,532,0001,015,0002,265,088