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 23, 2026 08:44Kevin HeaveyKevin HeaveyScore: 3,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:463,26735,920,28625,969,0001,148,0002,113,536
2Sep 23, 2026 08:463,27136,762,50126,118,0001,038,0002,113,536
3Sep 23, 2026 08:463,28036,790,47626,201,0001,029,0002,113,536
4Sep 23, 2026 08:463,28136,104,58826,218,0001,022,0002,113,536
5Sep 23, 2026 08:463,28436,911,47426,251,0001,012,0002,113,536
6Sep 23, 2026 08:463,28736,093,92526,091,0001,196,0002,113,536
7Sep 23, 2026 08:463,29336,956,05226,145,0001,193,0002,113,536
8Sep 23, 2026 08:463,31644,440,48326,483,0001,040,0002,113,536
9Sep 23, 2026 08:463,34843,690,72726,634,0001,160,0002,113,536