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 16, 2026 22:17Victor MerckléVictor MerckléScore: 46,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 22:1846,296394,095,198383,146,0001,116,0002,117,632stderr
2Sep 16, 2026 22:1846,416394,987,354384,121,0001,138,0002,117,632stderr
3Sep 16, 2026 22:1846,420395,143,876384,262,0001,024,0002,117,632stderr
4Sep 16, 2026 22:1846,442395,311,751384,454,0001,016,0002,117,632stderr
5Sep 16, 2026 22:1846,486395,698,178384,834,0001,008,0002,117,632stderr
6Sep 16, 2026 22:1846,489395,832,103384,760,0001,106,0002,117,632stderr
7Sep 16, 2026 22:1846,519396,017,609384,997,0001,113,0002,117,632stderr
8Sep 16, 2026 22:1846,632396,933,482385,936,0001,111,0002,117,632stderr
9Sep 16, 2026 22:1846,659398,405,426386,253,0001,024,0002,117,632stderr