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 listMay 22, 2026 07:56Victor MerckléVictor MerckléScore: 4,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 07:574,56345,746,31736,818,0001,061,0002,113,536
2May 22, 2026 07:574,56648,519,56036,822,0001,081,0002,113,536
3May 22, 2026 07:574,57347,139,42036,902,0001,056,0002,113,536
4May 22, 2026 07:574,57648,960,79636,900,0001,086,0002,113,536
5May 22, 2026 07:574,57848,978,17736,943,0001,057,0002,113,536
6May 22, 2026 07:574,57945,760,72936,937,0001,071,0002,113,536
7May 22, 2026 07:574,58546,340,84337,033,0001,029,0002,113,536
8May 22, 2026 07:574,59447,956,09137,130,0001,008,0002,113,536
9May 22, 2026 07:574,59848,016,38337,156,0001,013,0002,113,536