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 01:03Andrew EpsteinAndrew EpsteinScore: 228,378Success
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 01:04227,7731,901,738,6761,888,447,0002,074,0002,117,632stderr
2Sep 17, 2026 01:04227,8361,902,080,1301,888,960,0002,085,0002,117,632stderr
3Sep 17, 2026 01:04227,8751,902,458,9511,889,182,0002,183,0002,117,632stderr
4Sep 17, 2026 01:04227,9691,903,277,9941,890,044,0002,106,0002,117,632stderr
5Sep 17, 2026 01:04228,3781,906,113,7331,893,390,0002,152,0002,117,632stderr
6Sep 17, 2026 01:04228,4981,907,622,5461,894,417,0002,120,0002,117,632stderr
7Sep 17, 2026 01:04228,5311,907,287,3371,894,689,0002,126,0002,117,632stderr
8Sep 17, 2026 01:04228,8641,909,976,0001,897,429,0002,145,0002,117,632stderr
9Sep 17, 2026 01:04229,8321,918,614,0571,905,324,0002,285,0002,117,632stderr