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 listApr 11, 2026 17:26Danylo MocherniukDanylo MocherniukError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 15:11M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:310515,888,207501,133,0006,383,0002,121,728expected "11318049299365247 ", got "573580159874412151 "stderr
2May 17, 2026 15:310519,807,341504,662,0006,111,0002,121,728expected "11318049299365247 ", got "573580159874412151 "stderr
3May 17, 2026 15:310511,308,941496,490,0006,151,0002,121,728expected "11318049299365247 ", got "573580159874412151 "stderr
4Apr 11, 2026 17:274,44454,912,31334,889,0001,993,0002,383,872
5Apr 11, 2026 17:274,50759,264,44734,379,0003,033,0002,281,472
6Apr 11, 2026 17:274,52462,934,37436,539,0001,014,0002,535,424
7Apr 11, 2026 17:264,53567,630,04535,610,0002,034,0002,281,472
8Apr 11, 2026 17:264,54061,733,74936,662,0001,018,0002,281,472
9Apr 11, 2026 17:264,57963,641,59636,008,0002,000,0002,281,472