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 20:29Victor MerckléVictor MerckléScore: 3,498Success
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 20:293,45136,936,36927,522,0001,122,0002,117,632stderr
2Sep 8, 2026 20:293,45736,999,48427,688,0001,013,0002,117,632stderr
3Sep 8, 2026 20:293,46237,096,26527,613,0001,124,0002,117,632stderr
4Sep 8, 2026 20:293,48938,686,70627,827,0001,137,0002,117,632stderr
5Sep 8, 2026 20:293,49837,327,81227,918,0001,119,0002,117,632stderr
6Sep 8, 2026 20:293,50437,358,97327,964,0001,124,0002,117,632stderr
7Sep 8, 2026 20:293,53837,546,90528,245,0001,123,0002,117,632stderr
8Sep 8, 2026 20:293,55937,598,89628,407,0001,138,0002,117,632stderr
9Sep 8, 2026 20:293,75647,854,97130,171,0001,008,0002,117,632stderr