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 listMay 24, 2026 19:55Victor MerckléVictor MerckléScore: 4,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:564,94550,284,83639,969,0001,077,0002,113,536
2May 24, 2026 19:564,97049,050,11940,231,0001,026,0002,113,536
3May 24, 2026 19:564,97651,164,36440,299,0001,003,0002,113,536
4May 24, 2026 19:564,97949,144,33840,284,0001,042,0002,113,536
5May 24, 2026 19:564,99750,206,98340,387,0001,090,0002,113,536
6May 24, 2026 19:565,09953,091,95241,283,0001,041,0002,113,536
7May 24, 2026 19:565,10058,533,68441,303,0001,028,0002,113,536
8May 24, 2026 19:565,18255,861,39641,944,0001,069,0002,113,536
9May 24, 2026 19:565,23352,004,06742,439,0001,002,0002,113,536