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 7, 2026 23:56Victor MerckléVictor MerckléScore: 4,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 23:584,09844,586,42630,013,0004,001,00024,576stderr
2Sep 7, 2026 23:584,10042,583,61530,050,0003,981,00024,576stderr
3Sep 7, 2026 23:584,10942,695,49930,016,0004,096,00024,576stderr
4Sep 7, 2026 23:584,16243,118,59230,043,0004,509,00024,576stderr
5Sep 7, 2026 23:584,17543,192,73430,270,0004,389,00024,576stderr
6Sep 7, 2026 23:584,18043,365,55530,075,0004,621,00024,576stderr
7Sep 7, 2026 23:584,20844,109,07230,007,0004,924,0002,117,632stderr
8Sep 7, 2026 23:584,23144,346,80030,193,0004,930,0002,117,632stderr
9Sep 7, 2026 23:584,23144,296,13930,206,0004,917,0002,117,632stderr