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 6, 2026 02:51CheckHarryCheckHarryScore: 6,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:536,06260,155,98749,277,0001,039,0002,113,536
2Sep 6, 2026 02:536,06760,353,05549,322,0001,042,0002,113,536
3Sep 6, 2026 02:536,06960,310,89349,356,0001,023,0002,113,536
4Sep 6, 2026 02:536,07660,358,83449,405,0001,033,0002,113,536
5Sep 6, 2026 02:536,09760,545,38249,559,0001,049,0002,113,536
6Sep 6, 2026 02:536,16562,256,20850,012,0001,162,0002,113,536
7Sep 6, 2026 02:536,18661,264,61450,309,0001,035,0002,113,536
8Sep 6, 2026 02:536,21061,439,53850,515,0001,036,0002,113,536
9Sep 6, 2026 02:536,29762,140,90951,233,0001,040,0002,113,536