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 listFeb 20, 2026 14:00wnwnScore: 5,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 14:015,05265,426,50339,938,0001,996,0002,277,376
2Feb 20, 2026 14:015,05364,794,94039,946,0001,997,0002,498,560
3Feb 20, 2026 14:015,05569,596,12539,959,0001,997,0002,494,464
4Feb 20, 2026 14:015,05962,322,84539,990,0001,999,0002,277,376
5Feb 20, 2026 14:015,07265,913,86240,097,0002,004,0002,535,424
6Feb 20, 2026 14:015,07465,723,34540,107,0002,005,0002,277,376
7Feb 20, 2026 14:015,07559,808,33540,119,0002,005,0002,535,424
8Feb 20, 2026 14:015,07864,878,03240,139,0002,006,0002,277,376
9Feb 20, 2026 14:015,07967,309,72740,147,0002,007,0002,498,560