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 13, 2026 21:35Victor MerckléVictor MerckléScore: 7,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:367,59871,442,81462,066,0001,004,0002,113,536
2May 13, 2026 21:367,60172,182,12062,057,0001,036,0002,113,536
3May 13, 2026 21:367,60372,923,14462,108,0001,003,0002,113,536
4May 13, 2026 21:367,60370,330,38162,095,0001,018,0002,113,536
5May 13, 2026 21:367,60476,150,22363,115,00002,113,536
6May 13, 2026 21:367,60572,179,53962,089,0001,039,0002,113,536
7May 13, 2026 21:367,60572,879,69462,122,0001,004,0002,113,536
8May 13, 2026 21:367,60872,799,06162,129,0001,018,0002,113,536
9May 13, 2026 21:367,61771,928,68462,100,0001,127,0002,113,536