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:14CheckHarryCheckHarryScore: 6,321Success
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:166,23861,662,99250,763,0001,018,0002,113,536
2Sep 6, 2026 03:166,26661,897,58450,996,0001,020,0002,113,536
3Sep 6, 2026 03:166,28162,044,47951,111,0001,022,0002,113,536
4Sep 6, 2026 03:166,29762,166,04451,252,0001,014,0002,113,536
5Sep 6, 2026 03:166,32162,424,23151,452,0001,020,0002,113,536
6Sep 6, 2026 03:166,32362,404,83651,456,0001,029,0002,113,536
7Sep 6, 2026 03:166,35263,767,85951,714,0001,011,0002,113,536
8Sep 6, 2026 03:166,37962,906,07251,917,0001,033,0002,113,536
9Sep 6, 2026 03:166,45463,415,28852,559,0001,011,0002,113,536