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 18, 2026 20:35wnwnScore: 7,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:356,21775,850,48650,593,0001,011,0002,281,472
2Feb 18, 2026 20:356,24379,174,76849,827,0001,993,0002,506,752
3Feb 18, 2026 20:356,36574,223,58550,838,0001,993,0002,293,760
4Feb 18, 2026 20:357,25887,399,37259,241,0001,004,0002,453,504
5Feb 18, 2026 20:357,44486,465,58560,788,000996,0002,392,064
6Feb 18, 2026 20:357,47185,412,95158,010,0004,000,0002,457,600