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 13, 2026 18:31Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:29Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:29047,524,80738,291,0001,117,0002,117,632expected "74600294196621100 ", got "15157161612717868 "
2Jul 7, 2026 03:29047,320,20838,086,0001,191,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
3Jul 7, 2026 03:29047,253,57538,000,0001,104,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
4Apr 13, 2026 18:314,88667,170,47439,539,0001,013,0002,473,984
5Apr 13, 2026 18:314,92264,935,16438,862,0001,992,0002,535,424
6Apr 13, 2026 18:314,92668,868,69438,889,0001,994,0002,535,424