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 listSep 21, 2026 17:58C21C21Score: 14,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:5914,653132,143,508120,457,0001,170,0002,113,536
2Sep 21, 2026 17:5914,662132,188,428120,529,0001,167,0002,113,536
3Sep 21, 2026 17:5914,663132,183,954120,530,0001,176,0002,113,536
4Sep 21, 2026 17:5914,668132,212,241120,498,0001,254,0002,113,536
5Sep 21, 2026 17:5914,674132,306,021120,567,0001,230,0002,113,536
6Sep 21, 2026 17:5914,678132,294,007120,598,0001,230,0002,113,536
7Sep 21, 2026 17:5915,280137,235,033125,677,0001,155,0002,113,536
8Sep 21, 2026 17:5915,291137,438,783125,762,0001,155,0002,113,536
9Sep 21, 2026 17:5915,295137,355,993125,691,0001,258,0002,113,536