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 16:41Andrew EpsteinAndrew EpsteinScore: 9,898Success
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 16:469,74089,344,92479,766,0001,084,0002,117,632stderr
2Sep 17, 2026 16:469,74790,877,10979,837,0001,066,0002,117,632stderr
3Sep 17, 2026 16:469,86890,468,13480,833,0001,075,0002,117,632stderr
4Sep 17, 2026 16:469,89090,981,16581,036,0001,056,0002,117,632stderr
5Sep 17, 2026 16:469,89890,859,21381,062,0001,096,0002,117,632stderr
6Sep 17, 2026 16:469,90092,229,04281,101,0001,074,0002,117,632stderr
7Sep 17, 2026 16:469,92591,127,02881,309,0001,075,0002,117,632stderr
8Sep 17, 2026 16:469,92991,120,79781,343,0001,070,0002,117,632stderr
9Sep 17, 2026 16:469,93491,170,80981,393,0001,067,0002,117,632stderr