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 20, 2026 05:34M-RochatM-RochatScore: 12,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3412,546114,429,193101,808,0002,329,0002,113,536
2May 20, 2026 05:3412,565113,713,706102,279,0002,014,0002,113,536
3May 20, 2026 05:3412,581114,682,111102,096,0002,332,0002,113,536
4May 20, 2026 05:3412,593115,632,256102,201,0002,326,0002,113,536
5May 20, 2026 05:3412,614114,689,805102,355,0002,345,0002,113,536
6May 20, 2026 05:3412,615116,224,477102,703,0002,008,0002,113,536
7May 20, 2026 05:3412,622115,792,446102,690,0002,077,0002,113,536
8May 20, 2026 05:3412,674114,822,095103,142,0002,057,0002,113,536
9May 20, 2026 05:3412,707117,662,058103,387,0002,087,0002,113,536