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 listMar 29, 2026 13:22BrillentypBrillentypScore: 52,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:2052,870466,928,618437,824,000999,0002,367,488
2Mar 29, 2026 13:2052,881464,899,842436,914,0001,999,0002,355,200
3Mar 29, 2026 13:2252,886461,352,754435,954,0002,999,0002,277,376
4Mar 29, 2026 13:2252,900466,650,742437,070,0002,000,0002,363,392
5Mar 29, 2026 13:2052,904461,602,039436,102,0003,000,0002,277,376
6Mar 29, 2026 13:2253,002469,029,562436,921,0002,999,0002,277,376