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,840Success
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,83341,749,49330,806,0001,013,0002,113,536
2Sep 6, 2026 03:053,83941,790,40730,856,0001,013,0002,113,536
3Sep 6, 2026 03:053,83941,705,88430,844,0001,021,0002,113,536
4Sep 6, 2026 03:053,83942,895,01930,844,0001,020,0002,113,536
5Sep 6, 2026 03:053,84041,769,95430,866,0001,009,0002,113,536
6Sep 6, 2026 03:053,85241,894,84230,831,0001,148,0002,113,536
7Sep 6, 2026 03:053,85341,901,66730,919,0001,061,0002,113,536
8Sep 6, 2026 03:053,85941,879,48031,022,0001,015,0002,113,536
9Sep 6, 2026 03:053,87742,057,37431,173,0001,010,0002,113,536