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 listNov 1, 2026 19:28ambarish1729ambarish1729Score: 58,366Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Nov 2, 2026 14:17Andrew Epstein17.13CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 19:2857,348486,844,418474,924,0001,065,0002,113,536
2Nov 1, 2026 19:2858,366495,305,828483,438,0001,002,0002,113,536
3Nov 1, 2026 19:2858,426496,137,557483,675,0001,268,0002,113,536