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 19:31Victor MerckléVictor MerckléScore: 7,227Success
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 19:327,20568,601,74058,753,0001,052,0002,113,536
2May 17, 2026 19:327,20567,541,96758,783,0001,021,0002,113,536
3May 17, 2026 19:327,20667,539,56358,757,0001,054,0002,113,536
4May 17, 2026 19:327,22469,848,70758,916,0001,049,0002,113,536
5May 17, 2026 19:327,22769,632,96258,945,0001,047,0002,113,536
6May 17, 2026 19:327,24169,608,43759,066,0001,042,0002,113,536
7May 17, 2026 19:327,26568,182,18059,278,0001,024,0002,113,536
8May 17, 2026 19:327,34771,473,39159,900,0001,082,0002,113,536
9May 17, 2026 19:327,55471,854,71661,687,0001,014,0002,113,536