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 12, 2026 14:13Kevin HeaveyKevin HeaveyScore: 3,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:143,88841,955,99531,080,0001,193,0002,117,632
2Jul 12, 2026 14:143,88941,972,84931,265,0001,021,0002,117,632
3Jul 12, 2026 14:143,89341,970,02331,299,0001,021,0002,117,632
4Jul 12, 2026 14:143,89642,053,17831,151,0001,194,0002,117,632
5Jul 12, 2026 14:143,89941,937,05431,324,0001,042,0002,117,632
6Jul 12, 2026 14:143,90342,039,78731,371,0001,029,0002,117,632
7Jul 12, 2026 14:143,90442,002,21531,389,0001,021,0002,117,632
8Jul 12, 2026 14:145,63156,363,34745,456,0001,285,0002,117,632
9Jul 12, 2026 14:145,63856,413,77245,584,0001,215,0002,117,632