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 listMar 14, 2026 20:58wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:23041,602,46532,388,0001,138,0002,117,632expected "74600294196621100 ", got "44827579176153900 "
2Jul 6, 2026 22:23041,487,75132,242,0001,152,0002,113,536expected "74600294196621100 ", got "44852215344613932 "
3Jul 6, 2026 22:23040,606,42831,650,0001,087,0002,113,536expected "74600294196621100 ", got "44823075754606636 "
4Mar 14, 2026 20:584,22657,201,24133,068,0002,004,0002,494,464
5Mar 14, 2026 20:574,25257,626,51534,286,0001,008,0002,273,280
6Mar 14, 2026 20:574,25655,251,62434,316,0001,009,0002,486,272
7Mar 14, 2026 20:584,26056,499,85434,347,0001,010,0002,273,280
8Mar 14, 2026 20:574,27162,078,23834,436,0001,012,0002,482,176
9Mar 14, 2026 20:584,27356,270,71034,457,0001,013,0002,273,280