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 21, 2026 12:57Victor MerckléVictor MerckléScore: 4,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:584,63147,261,53637,383,0001,055,0002,113,536
2May 21, 2026 12:584,63348,030,45937,396,0001,066,0002,113,536
3May 21, 2026 12:584,63747,139,77137,423,0001,068,0002,113,536
4May 21, 2026 12:584,63946,569,48237,448,0001,061,0002,113,536
5May 21, 2026 12:584,64547,724,83537,422,0001,137,0002,113,536
6May 21, 2026 12:584,65046,425,17137,527,0001,073,0002,113,536
7May 21, 2026 12:584,65748,048,57537,627,0001,034,0002,113,536
8May 21, 2026 12:584,68147,359,45937,848,0001,009,0002,113,536
9May 21, 2026 12:584,90249,247,69339,653,0001,034,0002,113,536