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 8, 2026 07:56Victor MerckléVictor MerckléScore: 7,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 08:007,34669,493,68346,583,00014,392,0002,117,632stderr
2Sep 8, 2026 08:007,66972,291,75447,088,00016,567,0002,117,632stderr
3Sep 8, 2026 08:007,90674,101,10346,707,00018,918,0002,117,632stderr
4Sep 8, 2026 08:007,94775,083,53347,094,00018,871,0002,117,632stderr
5Sep 8, 2026 08:007,96175,244,24247,104,00018,976,0002,117,632stderr
6Sep 8, 2026 08:008,02075,667,53546,965,00019,607,0002,117,632stderr
7Sep 8, 2026 08:008,02575,715,88946,838,00019,774,00024,576stderr
8Sep 8, 2026 08:008,03175,468,36346,507,00020,152,0002,117,632stderr
9Sep 8, 2026 08:008,06476,078,92147,015,00019,922,0002,117,632stderr