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,916Success
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:519,84990,464,42580,682,0001,065,0002,117,632stderr
2Sep 17, 2026 16:519,85790,547,41280,743,0001,074,0002,117,632stderr
3Sep 17, 2026 16:519,89090,898,18181,020,0001,074,0002,117,632stderr
4Sep 17, 2026 16:519,90591,033,66081,148,0001,070,0002,117,632stderr
5Sep 17, 2026 16:519,91690,983,36381,243,0001,064,0002,117,632stderr
6Sep 17, 2026 16:519,91991,532,35081,265,0001,064,0002,117,632stderr
7Sep 17, 2026 16:519,94991,175,53181,487,0001,097,0002,117,632stderr
8Sep 17, 2026 16:519,95691,405,24081,587,0001,050,0002,117,632stderr
9Sep 17, 2026 16:519,97992,861,77181,687,0001,143,0002,117,632stderr