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:57Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:490642,915,51933,695,0001,133,0002,117,632expected "74600294196621100 ", got "15382831187587260 "
2Jul 6, 2026 23:490642,194,37033,102,0001,051,0002,117,632expected "74600294196621100 ", got "15382837741203244 "
3Jul 6, 2026 23:490642,551,14233,466,0001,129,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:574,306661,828,42433,758,0001,985,0002,314,240
5Apr 13, 2026 18:574,308661,817,28933,768,0001,986,0002,314,240
6Apr 13, 2026 18:574,326663,349,69434,907,000997,0002,314,240