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 listAug 21, 2026 01:11Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:55Tomislav Tunkovic35.46CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:58012,865,1591,550,0001,550,00020,480No answer to stdout. Died or killed?
2Aug 21, 2026 01:114,44246,625,09634,589,0002,285,0002,113,536
3Aug 21, 2026 01:114,55247,574,22635,476,0002,306,0002,113,536
4Aug 21, 2026 01:114,58447,946,21535,928,0002,122,0002,113,536
5Aug 21, 2026 01:114,62048,095,26336,040,0002,307,0002,113,536
6Aug 21, 2026 01:114,63648,337,76436,165,0002,316,0002,113,536
7Aug 21, 2026 01:114,63748,262,88536,079,0002,413,0002,113,536
8Aug 21, 2026 01:114,63748,210,08236,182,0002,307,0002,113,536
9Aug 21, 2026 01:114,65248,273,24536,242,0002,377,0002,113,536
10Aug 21, 2026 01:114,66048,521,23036,358,0002,327,0002,113,536