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 25, 2026 15:56Kenzie_RTKenzie_RTScore: 104,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 15:57103,381869,274,473763,581,00094,486,0002,113,536
2May 25, 2026 15:57103,509871,408,799763,573,00095,559,0002,113,536
3May 25, 2026 15:57103,573869,769,328764,158,00095,500,0002,113,536
4May 25, 2026 15:57103,673871,706,790763,737,00096,749,0002,113,536
5May 25, 2026 15:57104,078874,549,364764,844,00099,011,0002,113,536
6May 25, 2026 15:57104,119873,938,539764,538,00099,652,0002,113,536
7May 25, 2026 15:57104,344875,968,076765,200,000100,863,0002,113,536
8May 25, 2026 15:57104,440878,034,396766,117,000100,738,0002,113,536
9May 25, 2026 15:57104,458878,283,362765,422,000101,581,0002,113,536