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 07:46Andrew EpsteinAndrew EpsteinScore: 130,774Success
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 07:52130,2051,090,039,7101,077,607,0003,096,0002,121,728stderr
2Nov 3, 2026 07:52130,3331,091,145,2751,078,744,0003,022,0002,121,728stderr
3Nov 3, 2026 07:52130,3541,091,296,4291,078,919,0003,025,0002,121,728stderr
4Nov 3, 2026 07:52130,7441,094,558,7211,081,999,0003,181,0002,121,728stderr
5Nov 3, 2026 07:52130,7741,095,177,4841,083,416,0002,010,0002,121,728stderr
6Nov 3, 2026 07:52130,7831,094,935,3221,083,486,0002,016,0002,121,728stderr
7Nov 3, 2026 07:52130,8311,095,212,3981,082,842,0003,058,0002,121,728stderr
8Nov 3, 2026 07:52131,0991,097,684,6551,085,067,0003,055,0002,121,728stderr
9Nov 3, 2026 07:52131,1721,098,048,1571,086,725,0002,010,0002,121,728stderr