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 listOct 24, 2026 15:32timothygktimothygkError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:12Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 16:15028,171,4126,324,00010,488,00020,480No answer to stdout. Died or killed?stderr
2Oct 24, 2026 15:368,45481,164,79559,791,00010,385,0002,117,632stderr
3Oct 24, 2026 15:368,46181,266,87859,822,00010,407,0002,117,632stderr
4Oct 24, 2026 15:368,46781,212,90060,441,0009,839,0002,117,632stderr
5Oct 24, 2026 15:368,47581,493,88559,913,00010,436,0002,117,632stderr
6Oct 24, 2026 15:368,51981,723,19360,151,00010,557,0002,117,632stderr
7Oct 24, 2026 15:368,55681,967,21260,272,00010,747,0002,117,632stderr
8Oct 24, 2026 15:368,62083,017,34560,556,00010,995,0002,117,632stderr
9Oct 24, 2026 15:368,65082,841,83260,751,00011,045,0002,117,632stderr
10Oct 24, 2026 15:368,70483,750,36361,256,00010,989,0002,117,632stderr