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 19:51Victor MerckléVictor MerckléScore: 3,551Success
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 19:563,49437,560,68727,907,0001,095,0002,117,632stderr
2Sep 8, 2026 19:563,51937,720,47428,113,0001,099,0002,117,632stderr
3Sep 8, 2026 19:563,53838,562,81928,285,0001,088,0002,117,632stderr
4Sep 8, 2026 19:563,53838,545,84928,263,0001,107,0002,117,632stderr
5Sep 8, 2026 19:563,55137,899,47428,385,0001,096,0002,117,632stderr
6Sep 8, 2026 19:563,55638,746,53928,421,0001,097,0002,117,632stderr
7Sep 8, 2026 19:563,55837,822,41828,390,0001,147,0002,117,632stderr
8Sep 8, 2026 19:563,56338,863,53228,464,0001,117,0002,117,632stderr
9Sep 8, 2026 19:563,56938,743,20228,539,0001,087,0002,117,632stderr