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 01:24Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:24043,334,61934,219,0001,188,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
2Jul 7, 2026 01:24042,824,90733,852,0001,107,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
3Jul 7, 2026 01:24043,022,21633,991,0001,111,0002,117,632expected "74600294196621100 ", got "14947970700717868 "
4Apr 13, 2026 18:314,38161,237,17335,356,0001,010,0002,535,424
5Apr 13, 2026 18:314,38961,943,54835,419,0001,011,0002,535,424
6Apr 13, 2026 18:314,39856,694,56935,492,0001,014,0002,310,144