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 6, 2026 03:59CheckHarryCheckHarryScore: 3,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 04:003,84241,805,47030,880,0001,013,0002,113,536
2Sep 6, 2026 04:003,84941,801,41830,941,0001,008,0002,113,536
3Sep 6, 2026 04:003,89642,205,79231,321,0001,016,0002,113,536
4Sep 6, 2026 04:003,92342,547,26131,551,0001,010,0002,113,536
5Sep 6, 2026 04:003,92942,500,25031,602,0001,011,0002,113,536
6Sep 6, 2026 04:003,94942,708,42931,769,0001,009,0002,113,536
7Sep 6, 2026 04:003,96842,822,15831,899,0001,041,0002,113,536
8Sep 6, 2026 04:003,97942,897,11131,989,0001,039,0002,113,536
9Sep 6, 2026 04:004,28357,894,07634,481,0001,075,0002,117,632