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 29, 2025 12:58GabriellaGabriellaScore: 61,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:5861,613542,092,330510,390,0001,000,0002,265,088
2May 29, 2025 12:5861,615537,211,826511,407,00002,269,184
3May 29, 2025 12:5861,618536,382,149509,428,0002,001,0002,531,328
4May 29, 2025 12:5861,620537,562,795510,449,000998,0002,269,184
5May 29, 2025 12:5861,631539,973,250510,536,000999,0002,519,040
6May 29, 2025 12:5861,632537,553,937508,546,0002,997,0002,527,232
7May 29, 2025 12:5861,640539,501,914510,613,000999,0002,527,232
8May 29, 2025 12:5861,641534,667,751507,627,0003,997,0002,428,928
9May 29, 2025 12:5861,641540,479,181510,622,000999,0002,531,328