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 listAug 28, 2026 18:58Victor MerckléVictor MerckléScore: 5,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:585,76956,265,68545,762,0002,128,0002,117,632stderr
2Aug 28, 2026 18:585,78057,332,34345,857,0002,119,0002,117,632stderr
3Aug 28, 2026 18:585,79357,147,39245,969,0002,117,0002,117,632stderr
4Aug 28, 2026 18:585,79657,130,72245,991,0002,121,0002,117,632stderr
5Aug 28, 2026 18:585,80356,517,09046,047,0002,124,0002,117,632stderr
6Aug 28, 2026 18:585,82757,386,14946,225,0002,143,0002,117,632stderr
7Aug 28, 2026 18:585,82956,740,74046,235,0002,151,0002,117,632stderr
8Aug 28, 2026 18:585,86057,605,11546,505,0002,141,0002,117,632stderr
9Aug 28, 2026 18:585,89858,017,50846,771,0002,184,0002,117,632stderr