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 24, 2026 20:06Maya RebholzMaya RebholzScore: 7,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:077,42672,566,64056,385,0005,259,0002,113,536
2May 24, 2026 20:077,45873,261,45456,738,0005,167,0002,117,632
3May 24, 2026 20:077,46074,065,46956,769,0005,151,0002,117,632
4May 24, 2026 20:077,49772,565,21956,710,0005,521,0002,113,536
5May 24, 2026 20:077,50273,765,86556,810,0005,460,0002,117,632
6May 24, 2026 20:077,51273,116,78956,853,0005,501,0002,117,632
7May 24, 2026 20:077,57675,101,36857,375,0005,506,0002,113,536
8May 24, 2026 20:077,97075,870,20160,614,0005,539,0002,113,536
9May 24, 2026 20:078,00175,782,16460,986,0005,427,0002,113,536