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 listSep 17, 2026 00:19Andrew EpsteinAndrew EpsteinScore: 3,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:203,89142,373,89629,405,0002,897,0002,125,824stderr
2Sep 17, 2026 00:203,89142,405,82429,409,0002,893,0002,125,824stderr
3Sep 17, 2026 00:203,91442,591,13529,565,0002,925,0002,125,824stderr
4Sep 17, 2026 00:203,91742,719,19929,597,0002,916,0002,125,824stderr
5Sep 17, 2026 00:203,92142,676,35329,592,0002,957,0002,125,824stderr
6Sep 17, 2026 00:203,92642,650,97529,682,0002,908,0002,125,824stderr
7Sep 17, 2026 00:203,94442,839,93729,841,0002,900,0002,125,824stderr
8Sep 17, 2026 00:203,95542,999,23529,743,0003,086,0002,125,824stderr
9Sep 17, 2026 00:204,03343,555,24530,591,0002,886,0002,125,824stderr