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 13, 2026 03:58olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:18Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:19014,090,35001,060,000471,040Exit with code 1:
2Mar 13, 2026 03:582,31241,239,66619,193,00002,502,656
3Mar 13, 2026 03:582,31441,680,44519,203,00002,273,280
4Mar 13, 2026 03:582,31736,132,45819,232,00002,273,280
5Mar 13, 2026 03:582,31833,326,20219,237,00002,506,752
6Mar 13, 2026 03:582,31940,267,29819,248,00002,531,328
7Mar 13, 2026 03:582,31947,914,70219,248,00002,273,280
8Mar 13, 2026 03:582,32150,256,58619,262,00002,531,328
9Mar 13, 2026 03:582,32144,049,10119,267,00002,506,752
10Mar 13, 2026 03:582,32240,914,11619,273,00002,506,752