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 listFeb 11, 2026 18:39olliecrowolliecrowScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:395,91074,470,29244,050,0005,005,0002,453,504
2Feb 11, 2026 18:395,95174,130,87944,353,0005,040,0002,396,160
3Feb 11, 2026 18:396,06773,375,27246,331,0004,028,0002,387,968
4Feb 11, 2026 18:396,36179,284,03249,807,0002,988,0002,494,464
5Feb 11, 2026 18:396,40579,058,23649,150,0004,012,0002,318,336
6Feb 11, 2026 18:396,42981,082,54949,331,0004,027,0002,269,184