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 listJul 7, 2026 07:35Kevin HeaveyKevin HeaveyScore: 24,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 07:3523,688206,221,907186,440,00010,172,00024,576
2Jul 7, 2026 07:3523,709206,397,090186,097,00010,695,00024,576
3Jul 7, 2026 07:3523,828207,322,287189,249,0008,527,0002,117,632
4Jul 7, 2026 07:3523,893208,278,052190,019,0008,299,0002,117,632
5Jul 7, 2026 07:3524,071209,828,791190,619,0009,171,00024,576
6Jul 7, 2026 07:3524,077209,367,900190,476,0009,366,00024,576
7Jul 7, 2026 07:3524,177210,205,375192,122,0008,548,00024,576
8Jul 7, 2026 07:3526,012225,518,173207,761,0008,141,0002,117,632
9Jul 7, 2026 07:3528,389245,172,898227,200,0008,435,00024,576