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 11:54CheckHarryCheckHarryScore: 6,623Success
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 11:576,55364,347,28553,384,0001,014,0002,113,536
2Sep 6, 2026 11:576,56164,349,38853,449,0001,013,0002,113,536
3Sep 6, 2026 11:576,58164,459,37653,614,0001,014,0002,113,536
4Sep 6, 2026 11:576,58864,507,05453,672,0001,014,0002,113,536
5Sep 6, 2026 11:576,62364,875,74753,959,0001,013,0002,113,536
6Sep 6, 2026 11:576,62564,788,68553,976,0001,014,0002,113,536
7Sep 6, 2026 11:576,66077,732,64654,268,0001,015,0002,117,632
8Sep 6, 2026 11:576,66765,288,65954,327,0001,013,0002,113,536
9Sep 6, 2026 11:576,76366,009,84255,126,0001,014,0002,113,536