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 23, 2026 07:45Kevin HeaveyKevin HeaveyScore: 3,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:503,33136,311,93326,509,0001,145,0002,113,536
2Sep 23, 2026 07:503,34336,623,16926,705,0001,048,0002,113,536
3Sep 23, 2026 07:503,34436,453,30726,702,0001,055,0002,113,536
4Sep 23, 2026 07:503,34736,867,62926,579,0001,207,0002,113,536
5Sep 23, 2026 07:503,34736,634,85126,763,0001,021,0002,113,536
6Sep 23, 2026 07:503,35037,356,45926,792,0001,018,0002,113,536
7Sep 23, 2026 07:503,35636,892,22926,839,0001,019,0002,113,536
8Sep 23, 2026 07:503,35936,544,26826,853,0001,030,0002,113,536
9Sep 23, 2026 07:503,36038,555,38826,742,0001,154,0002,113,536