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 11, 2026 15:14caandocaandoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:55Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:56073,015,85960,618,0002,085,0002,113,536expected "27617841214539459 ", got "32573110645809634 "
2Jul 7, 2026 21:56073,015,00660,462,0002,290,0002,113,536expected "27617841214539459 ", got "32573110645809634 "
3Jul 7, 2026 21:56073,725,03961,607,0002,364,0002,113,536expected "27617841214539459 ", got "32573110645809634 "
4Mar 11, 2026 15:154,62561,563,38436,370,0002,020,0002,285,568
5Mar 11, 2026 15:154,63563,219,74636,446,0002,024,0002,285,568
6Mar 11, 2026 15:154,64459,492,05935,506,0003,043,0002,482,176