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:53wnwnScore: 4,274Success
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:564,05042,340,82027,432,0006,186,0002,113,536
2Sep 24, 2026 03:564,20343,617,35528,723,0006,165,0002,113,536
3Sep 24, 2026 03:564,23443,870,80228,711,0006,435,00020,480
4Sep 24, 2026 03:564,23844,570,45728,298,0006,883,00020,480
5Sep 24, 2026 03:564,27444,287,79028,549,0006,933,0002,113,536
6Sep 24, 2026 03:564,32645,320,23128,702,0007,210,0002,113,536
7Sep 24, 2026 03:564,34044,869,77828,311,0007,715,00020,480
8Sep 24, 2026 03:564,34644,836,25927,304,0008,770,00020,480
9Sep 24, 2026 03:564,38345,154,64628,114,0008,267,0002,113,536