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 listJun 24, 2026 20:48Victor MerckléVictor MerckléScore: 4,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:494,51545,519,95336,383,0001,092,0002,117,632stderr
2Jun 24, 2026 20:494,51545,498,20936,352,0001,126,0002,117,632stderr
3Jun 24, 2026 20:494,51745,032,56636,399,0001,093,0002,117,632stderr
4Jun 24, 2026 20:494,51945,147,74236,402,0001,108,0002,117,632stderr
5Jun 24, 2026 20:494,52245,558,94436,424,0001,109,0002,117,632stderr
6Jun 24, 2026 20:494,52445,540,51536,429,0001,121,0002,117,632stderr
7Jun 24, 2026 20:494,56945,587,58636,822,0001,105,0002,117,632stderr
8Jun 24, 2026 20:494,66246,435,69037,601,0001,098,0002,117,632stderr
9Jun 24, 2026 20:494,75346,921,70638,419,0001,036,0002,117,632stderr