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 listOct 21, 2026 14:25Maksim NikitinMaksim NikitinScore: 89,040Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 29, 2026 22:13Andrew Epstein11.23CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 14:2588,999750,052,917680,061,00058,631,0002,113,536
2Oct 21, 2026 14:2589,040750,369,358680,149,00058,883,0002,113,536
3Oct 21, 2026 14:2589,060750,607,531679,998,00059,203,0002,113,536