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 listJan 7, 2026 09:38Petsku01Petsku01Score: 62,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 09:3762,440546,120,431516,251,0002,000,0002,273,280
2Jan 7, 2026 09:3762,499555,328,541516,745,0001,999,0002,285,568
3Jan 7, 2026 09:3862,574547,821,992518,368,0001,000,0002,293,760
4Jan 7, 2026 09:3862,598544,493,433517,569,0001,998,0002,293,760
5Jan 7, 2026 09:3862,600544,725,925517,581,0001,998,0002,285,568
6Jan 7, 2026 09:3762,633543,477,920517,853,0001,999,0002,293,760