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:04CheckHarryCheckHarryScore: 3,834Success
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 03:053,82941,674,79730,772,0001,010,0002,113,536
2Sep 6, 2026 03:053,83141,694,06730,792,0001,012,0002,113,536
3Sep 6, 2026 03:053,83241,610,78630,773,0001,034,0002,113,536
4Sep 6, 2026 03:053,83341,689,05130,808,0001,013,0002,113,536
5Sep 6, 2026 03:053,83441,935,89830,819,0001,009,0002,113,536
6Sep 6, 2026 03:053,84241,739,76430,881,0001,010,0002,113,536
7Sep 6, 2026 03:053,84541,866,22530,910,0001,010,0002,113,536
8Sep 6, 2026 03:053,84941,828,21530,940,0001,012,0002,113,536
9Sep 6, 2026 03:053,93742,559,87231,668,0001,010,0002,113,536