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: 4,183Success
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:064,17744,553,76433,662,0001,009,0002,113,536
2Sep 6, 2026 03:064,17844,534,61933,668,0001,010,0002,113,536
3Sep 6, 2026 03:064,18044,668,13233,689,0001,009,0002,113,536
4Sep 6, 2026 03:064,18044,565,54633,681,0001,015,0002,113,536
5Sep 6, 2026 03:064,18344,650,17833,708,0001,013,0002,113,536
6Sep 6, 2026 03:064,20544,800,10333,898,0001,008,0002,113,536
7Sep 6, 2026 03:064,20644,778,50333,887,0001,025,0002,113,536
8Sep 6, 2026 03:064,21545,315,69033,979,0001,009,0002,113,536
9Sep 6, 2026 03:064,28045,412,49234,510,0001,019,0002,113,536