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:06wnwnScore: 3,491Success
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:073,33938,138,15126,680,0001,036,00020,480
2Sep 24, 2026 03:073,34136,520,79626,726,0001,008,00020,480
3Sep 24, 2026 03:073,37436,769,86528,009,000020,480
4Sep 24, 2026 03:073,43537,537,30327,499,0001,018,00020,480
5Sep 24, 2026 03:073,49138,428,05828,978,000020,480
6Sep 24, 2026 03:073,49238,383,34828,989,000020,480
7Sep 24, 2026 03:073,51838,678,53128,160,0001,045,0002,113,536
8Sep 24, 2026 03:073,53138,126,61429,308,000020,480
9Sep 24, 2026 03:073,54138,838,84028,364,0001,030,00020,480