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 listApr 19, 2026 03:34wnwnScore: 4,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:344,10056,386,88232,030,0002,001,0002,531,328
2Apr 19, 2026 03:344,10854,291,25232,090,0002,005,0002,494,464
3Apr 19, 2026 03:344,11352,902,72332,132,0002,008,0002,277,376
4Apr 19, 2026 03:344,65468,262,15237,613,0001,016,0002,498,560
5Apr 19, 2026 03:344,65564,303,82837,618,0001,016,0002,531,328
6Apr 19, 2026 03:344,75066,669,77138,416,0001,010,0002,269,184