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 21, 2026 12:41Victor MerckléVictor MerckléScore: 4,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:424,64346,446,86037,472,0001,069,0002,113,536
2May 21, 2026 12:424,65946,731,40537,614,0001,063,0002,113,536
3May 21, 2026 12:424,66646,682,47337,679,0001,050,0002,113,536
4May 21, 2026 12:424,66746,604,96937,727,0001,010,0002,113,536
5May 21, 2026 12:424,66946,673,37037,715,0001,040,0002,113,536
6May 21, 2026 12:424,68046,717,10337,813,0001,036,0002,113,536
7May 21, 2026 12:424,68246,698,83737,801,0001,067,0002,113,536
8May 21, 2026 12:424,69546,856,26237,971,0001,003,0002,113,536
9May 21, 2026 12:424,79054,597,62238,708,0001,057,0002,113,536