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 5, 2026 17:56CheckHarryCheckHarryScore: 4,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:574,21344,841,74833,954,0001,017,0002,113,536
2Sep 5, 2026 17:574,21345,198,98133,948,0001,020,0002,113,536
3Sep 5, 2026 17:574,22344,960,99034,042,0001,017,0002,113,536
4Sep 5, 2026 17:574,23645,057,97634,106,0001,058,0002,113,536
5Sep 5, 2026 17:574,32745,794,44034,881,0001,040,0002,113,536
6Sep 5, 2026 17:574,36046,106,99735,147,0001,047,0002,113,536
7Sep 5, 2026 17:574,38746,326,93835,378,0001,041,0002,113,536
8Sep 5, 2026 17:574,39946,405,64635,501,0001,016,0002,113,536
9Sep 5, 2026 17:574,41046,642,47035,587,0001,018,0002,113,536