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 29, 2026 10:01wnwnScore: 3,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:013,30036,184,08727,391,000020,480
2Sep 29, 2026 10:013,31136,383,23027,485,000020,480
3Sep 29, 2026 10:013,31236,232,79527,497,000020,480
4Sep 29, 2026 10:013,31236,274,50627,492,000020,480
5Sep 29, 2026 10:013,31736,355,49327,538,000020,480
6Sep 29, 2026 10:013,33036,466,83627,643,000020,480
7Sep 29, 2026 10:013,46837,558,26028,792,000020,480
8Sep 29, 2026 10:013,47340,990,75328,828,000020,480
9Sep 29, 2026 10:013,48937,707,51128,965,000020,480