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 3, 2026 07:32Priyansh RathiPriyansh RathiScore: 40,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 07:3240,523372,482,912334,343,0002,002,0002,543,616
2Mar 3, 2026 07:3240,539359,491,449336,471,00002,514,944
3Mar 3, 2026 07:3240,539373,016,924336,472,00002,371,584
4Mar 3, 2026 07:3240,541366,879,825335,488,0001,001,0002,543,616
5Mar 3, 2026 07:3240,542361,388,078336,502,00002,359,296
6Mar 3, 2026 07:3240,548365,859,000335,547,000998,0002,396,160
7Mar 3, 2026 07:3240,573362,743,865333,761,0002,997,0002,539,520
8Mar 3, 2026 07:3240,574361,972,911334,769,0001,998,0002,535,424
9Mar 3, 2026 07:3240,582367,401,228334,835,0001,999,0002,355,200