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:45M-RochatM-RochatScore: 12,469Success
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:4512,446114,747,984100,975,0002,331,0002,113,536
2May 20, 2026 05:4512,451113,969,615101,018,0002,330,0002,113,536
3May 20, 2026 05:4512,453114,556,130101,019,0002,343,0002,113,536
4May 20, 2026 05:4512,455112,797,449101,038,0002,339,0002,113,536
5May 20, 2026 05:4512,469113,171,316101,483,0002,012,0002,113,536
6May 20, 2026 05:4512,491115,675,907101,627,0002,052,0002,113,536
7May 20, 2026 05:4512,494113,692,805101,693,0002,012,0002,117,632
8May 20, 2026 05:4512,503113,452,556101,730,0002,050,0002,113,536
9May 20, 2026 05:4512,511113,720,422101,809,0002,038,0002,113,536