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 17, 2026 01:59M-RochatM-RochatScore: 12,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5912,622115,751,776102,559,0002,210,0002,113,536
2May 17, 2026 01:5912,649115,963,357102,744,0002,245,0002,113,536
3May 17, 2026 01:5912,655114,015,843102,816,0002,224,0002,113,536
4May 17, 2026 01:5912,663114,475,015102,839,0002,270,0002,113,536
5May 17, 2026 01:5912,680115,939,843102,976,0002,276,0002,113,536
6May 17, 2026 01:5912,682114,057,453103,065,0002,198,0002,113,536
7May 17, 2026 01:5912,705116,313,744101,993,0003,459,0002,113,536
8May 17, 2026 01:5912,707115,329,254103,314,0002,161,0002,113,536
9May 17, 2026 01:5912,746116,769,926102,537,0003,255,0002,113,536