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 21, 2026 07:22olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:39047,086,89736,503,0001,033,0002,117,632expected "74600294196621100 ", got "30383868655218476 "
2Jul 7, 2026 05:39047,059,32536,481,0001,031,0002,117,632expected "74600294196621100 ", got "30383868655218476 "
3Jul 7, 2026 05:39047,114,08136,539,0001,027,0002,117,632expected "74600294196621100 ", got "30398432210759468 "
4Mar 21, 2026 07:225,70976,403,84945,366,0002,016,0002,465,792
5Mar 21, 2026 07:225,76072,708,13943,822,0003,983,0002,371,584
6Mar 21, 2026 07:225,77669,441,05243,943,0003,994,0002,342,912