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 1, 2026 17:59Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 17:59047,565,63337,376,0001,164,0002,113,536expected "53679153837457263 ", got "53679153837457263 263 579 36583 215 1134 "
2Oct 1, 2026 17:59047,023,50136,849,0001,167,0002,113,536expected "53686144501938654 ", got "53686144501938654 263 559 36061 220 1162 "
3Oct 1, 2026 17:59047,101,76736,897,0001,158,0002,113,536expected "53683491727331454 ", got "53683491727331454 266 557 36103 221 1183 "