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 listNov 3, 2026 04:59Andrew EpsteinAndrew EpsteinScore: 87,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 05:1787,581736,244,253724,917,0002,010,0002,121,728stderr
2Nov 3, 2026 05:1787,659736,932,164725,559,0002,011,0002,121,728stderr
3Nov 3, 2026 05:1787,739737,586,478726,058,0002,176,0002,121,728stderr
4Nov 3, 2026 05:1787,745738,169,084726,279,0002,006,0002,121,728stderr
5Nov 3, 2026 05:1787,745737,619,581726,263,0002,022,0002,121,728stderr
6Nov 3, 2026 05:1787,747737,577,178726,304,0002,003,0002,121,728stderr
7Nov 3, 2026 05:1787,757737,809,516726,384,0002,005,0002,121,728stderr
8Nov 3, 2026 05:1787,828738,809,467726,972,0002,006,0002,121,728stderr
9Nov 3, 2026 05:1787,913739,197,438727,675,0002,003,0002,121,728stderr