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 24, 2026 03:45wnwnScore: 3,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:463,44937,386,83827,450,0001,181,00020,480
2Sep 24, 2026 03:463,49037,788,73927,807,0001,164,00020,480
3Sep 24, 2026 03:463,66539,169,84227,940,0002,486,00020,480
4Sep 24, 2026 03:463,67339,878,13128,959,0001,527,00020,480
5Sep 24, 2026 03:463,68839,989,28629,375,0001,236,00020,480
6Sep 24, 2026 03:463,76140,647,75229,605,0001,615,00020,480
7Sep 24, 2026 03:463,78240,707,91629,426,0001,965,00020,480
8Sep 24, 2026 03:463,80340,881,33629,176,0002,397,00020,480
9Sep 24, 2026 03:463,82541,132,89529,725,0002,028,0002,113,536