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 29, 2026 10:58wnwnScore: 3,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:583,28636,146,57327,278,000020,480
2Sep 29, 2026 10:583,29636,143,44627,365,000020,480
3Sep 29, 2026 10:583,30736,175,84727,456,000020,480
4Sep 29, 2026 10:583,30836,136,14327,463,000020,480
5Sep 29, 2026 10:583,31136,319,75227,484,000020,480
6Sep 29, 2026 10:583,31936,300,51427,550,000020,480
7Sep 29, 2026 10:583,32536,356,48127,602,000020,480
8Sep 29, 2026 10:583,41336,971,42228,333,000020,480
9Sep 29, 2026 10:583,45437,507,11028,669,000020,480