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 11:49Victor MerckléVictor MerckléScore: 4,570Success
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 11:524,37045,384,45531,141,0005,138,00024,576stderr
2Sep 8, 2026 11:524,38644,848,89230,827,0005,582,0002,117,632stderr
3Sep 8, 2026 11:524,40045,004,24031,359,0005,167,00024,576stderr
4Sep 8, 2026 11:524,54348,333,42931,227,0006,485,00024,576stderr
5Sep 8, 2026 11:524,57047,078,96031,405,0006,528,00024,576stderr
6Sep 8, 2026 11:524,60447,322,51430,983,0007,237,0002,117,632stderr
7Sep 8, 2026 11:524,64647,722,23631,288,0007,277,00024,576stderr
8Sep 8, 2026 11:524,66847,215,51831,381,0007,364,0002,117,632stderr
9Sep 8, 2026 11:524,68447,956,20631,488,0007,392,0002,117,632stderr