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 10, 2026 13:12wnwnScore: 3,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:123,41836,874,78728,372,00002,113,536
2May 10, 2026 13:123,42037,118,36628,391,00002,113,536
3May 10, 2026 13:123,42338,283,46528,418,00002,113,536
4May 10, 2026 13:123,43440,504,40628,504,00002,113,536
5May 10, 2026 13:123,43638,527,49928,522,00002,113,536
6May 10, 2026 13:123,44936,298,48628,630,00002,113,536
7May 10, 2026 13:123,45138,093,92428,646,00002,113,536
8May 10, 2026 13:123,45138,738,85328,650,00002,113,536
9May 10, 2026 13:123,46738,186,76328,781,00002,113,536