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 29, 2026 14:15Victor MerckléVictor MerckléScore: 4,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:164,85548,538,02839,175,0001,123,0002,125,824stderr
2Jun 29, 2026 14:164,85948,294,42439,323,0001,009,0002,125,824stderr
3Jun 29, 2026 14:164,85948,549,00639,231,0001,106,0002,125,824stderr
4Jun 29, 2026 14:164,86248,275,17339,246,0001,113,0002,125,824stderr
5Jun 29, 2026 14:164,86349,597,91639,228,0001,140,0002,125,824stderr
6Jun 29, 2026 14:164,86448,293,23539,273,0001,106,0002,125,824stderr
7Jun 29, 2026 14:164,87148,667,01539,304,0001,130,0002,125,824stderr
8Jun 29, 2026 14:164,87548,363,23739,343,0001,126,0002,125,824stderr
9Jun 29, 2026 14:164,91648,740,73039,768,0001,040,0002,125,824stderr