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 3, 2026 06:28CheckHarryCheckHarryScore: 8,247Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:298,20877,983,55667,119,0001,015,0002,113,536
2Sep 3, 2026 06:298,21678,011,39566,173,0002,020,0002,113,536
3Sep 3, 2026 06:298,22278,122,81967,236,0001,014,0002,113,536
4Sep 3, 2026 06:298,24178,222,66266,347,0002,056,0002,113,536
5Sep 3, 2026 06:298,24778,329,56766,399,0002,052,0002,113,536
6Sep 3, 2026 06:298,25878,319,96267,528,0001,014,0002,113,536
7Sep 3, 2026 06:298,25878,460,52666,498,0002,047,0002,113,536
8Sep 3, 2026 06:298,27978,585,62366,476,0002,242,0002,113,536
9Sep 3, 2026 06:298,32878,935,30367,072,0002,052,0002,113,536