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 20, 2025 22:55Cameron AavikCameron AavikScore: 34,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 22:5533,973311,589,416218,984,00062,995,0002,306,048
2Jan 20, 2025 22:5533,987307,511,709216,071,00066,021,0002,297,856
3Jan 20, 2025 22:5533,997307,039,354223,138,00059,036,0002,306,048
4Jan 20, 2025 22:5534,131309,949,011228,234,00055,056,0002,535,424
5Jan 20, 2025 22:5534,168315,606,105225,471,00058,121,0002,371,584
6Jan 20, 2025 22:5534,189313,491,596222,820,00060,950,0002,297,856
7Jan 20, 2025 22:5534,242308,592,859218,159,00066,048,0002,535,424
8Jan 20, 2025 22:5534,526317,468,595231,455,00055,108,0002,535,424
9Jan 20, 2025 22:5534,559314,859,718219,880,00066,963,0002,539,520