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 12:10CheckHarryCheckHarryScore: 4,014Success
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 12:113,99742,962,72232,169,0001,011,0002,113,536
2Sep 6, 2026 12:114,00343,118,98832,218,0001,010,0002,113,536
3Sep 6, 2026 12:114,00743,280,65632,212,0001,047,0002,113,536
4Sep 6, 2026 12:114,00943,223,37432,273,0001,009,0002,113,536
5Sep 6, 2026 12:114,01443,216,50932,269,0001,051,0002,113,536
6Sep 6, 2026 12:114,06244,880,76432,707,0001,012,0002,113,536
7Sep 6, 2026 12:114,16544,455,32433,550,0001,021,0002,113,536
8Sep 6, 2026 12:114,17544,496,55233,474,0001,179,0002,113,536
9Sep 6, 2026 12:114,22644,929,26934,074,0001,008,0002,113,536