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 19, 2026 08:05wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 20, 2026 15:51Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:510119,494,005105,951,0001,999,0002,269,184expected "24973913317 ", got "9220411441 "
2Apr 20, 2026 15:510128,539,337105,068,0002,001,0002,473,984expected "24978083937 ", got "9221827168 "
3Apr 20, 2026 15:510132,326,259106,556,0001,005,0002,465,792expected "24974492377 ", got "9221758099 "
4Apr 19, 2026 08:053,54050,444,18828,371,0001,013,0002,490,368
5Apr 19, 2026 08:053,54256,453,55228,389,0001,013,0002,277,376
6Apr 19, 2026 08:053,56658,588,28328,578,0001,020,0002,277,376