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 10, 2026 09:41wnwnScore: 3,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:423,29535,399,08526,316,0001,034,0002,113,536
2Jul 10, 2026 09:423,30035,434,20426,369,0001,028,0002,113,536
3Jul 10, 2026 09:423,31435,363,77726,498,0001,013,0002,113,536
4Jul 10, 2026 09:423,31935,653,45626,520,0001,034,0002,113,536
5Jul 10, 2026 09:423,33235,513,36126,648,0001,013,0002,113,536
6Jul 10, 2026 09:423,40836,341,52627,253,0001,038,0002,113,536
7Jul 10, 2026 09:423,43336,545,97027,460,0001,039,0002,113,536
8Jul 10, 2026 09:423,43537,092,12827,498,0001,013,0002,113,536
9Jul 10, 2026 09:423,48037,105,94227,883,0001,008,0002,113,536