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 2, 2026 16:40Priyansh RathiPriyansh RathiScore: 57,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 16:3957,454500,598,510475,866,000999,0002,371,584
2Mar 2, 2026 16:3957,658507,305,954475,562,0002,997,0002,396,160
3Mar 2, 2026 16:4057,661501,855,709476,592,0001,998,0002,396,160
4Mar 2, 2026 16:3957,872508,024,244479,335,0001,000,0002,359,296
5Mar 2, 2026 16:4057,919508,901,239478,732,0001,998,0002,547,712
6Mar 2, 2026 16:4058,238513,791,341482,376,0001,000,0002,371,584