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 00:19Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:55Tomislav Tunkovic14.11CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:58011,089,2051,347,000020,480No answer to stdout. Died or killed?
2Aug 21, 2026 00:195,49855,446,88744,500,0001,135,0002,113,536
3Aug 21, 2026 00:195,50555,488,79744,532,0001,160,0002,113,536
4Aug 21, 2026 00:195,51555,584,47844,672,0001,108,0002,113,536
5Aug 21, 2026 00:195,52655,599,34544,720,0001,149,0002,113,536
6Aug 21, 2026 00:195,54855,867,87544,926,0001,126,0002,113,536
7Aug 21, 2026 00:195,60656,331,77545,409,0001,124,0002,113,536
8Aug 21, 2026 00:195,61556,402,80345,486,0001,124,0002,113,536
9Aug 21, 2026 00:195,67556,969,81645,999,0001,107,0002,113,536
10Aug 21, 2026 00:195,69457,002,50446,142,0001,123,0002,113,536