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 listSep 17, 2026 00:19Andrew EpsteinAndrew EpsteinScore: 3,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:193,81041,769,87529,544,0002,081,0002,121,728stderr
2Sep 17, 2026 00:193,81742,998,77429,582,0002,104,0002,121,728stderr
3Sep 17, 2026 00:193,82341,901,12829,653,0002,085,0002,121,728stderr
4Sep 17, 2026 00:193,82841,893,54529,685,0002,089,0002,121,728stderr
5Sep 17, 2026 00:193,93842,778,09630,593,0002,094,0002,121,728stderr
6Sep 17, 2026 00:193,94542,833,43230,644,0002,100,0002,121,728stderr
7Sep 17, 2026 00:193,94542,888,27730,634,0002,115,0002,121,728stderr
8Sep 17, 2026 00:193,94742,864,56230,686,0002,080,0002,121,728stderr
9Sep 17, 2026 00:193,95543,012,05030,726,0002,104,0002,121,728stderr