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 02:25Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:55Tomislav Tunkovic11.12CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 11:00014,359,7011,131,0002,267,00020,480No answer to stdout. Died or killed?
2Aug 21, 2026 02:253,90342,112,49630,135,0002,268,0002,113,536
3Aug 21, 2026 02:253,90742,221,54530,166,0002,270,0002,113,536
4Aug 21, 2026 02:253,91242,258,75730,173,0002,300,0002,113,536
5Aug 21, 2026 02:253,91442,273,27930,217,0002,274,0002,113,536
6Aug 21, 2026 02:253,97742,771,32130,683,0002,333,0002,113,536
7Aug 21, 2026 02:254,03843,270,06931,226,0002,295,0002,113,536
8Aug 21, 2026 02:254,05643,448,24731,396,0002,274,0002,113,536
9Aug 21, 2026 02:254,08143,679,49531,604,0002,272,0002,113,536
10Aug 21, 2026 02:254,10444,610,96231,748,0002,320,0002,113,536