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 12:09Kevin HeaveyKevin HeaveyScore: 3,215Success
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 12:183,20335,419,80726,592,000020,480
2Sep 23, 2026 12:183,20435,265,42926,594,000020,480
3Sep 23, 2026 12:183,20435,317,29426,598,000020,480
4Sep 23, 2026 12:183,21535,385,53025,671,0001,017,00020,480
5Sep 23, 2026 12:183,21535,676,54426,686,000020,480
6Sep 23, 2026 12:183,21835,250,01325,699,0001,017,00020,480
7Sep 23, 2026 12:183,21935,335,59025,701,0001,017,00020,480
8Sep 23, 2026 12:183,21935,336,45625,717,0001,002,00020,480
9Sep 23, 2026 12:183,22135,528,77226,742,000020,480