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 07:52CheckHarryCheckHarryScore: 4,693Success
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 07:534,67348,636,87037,784,0001,007,0002,113,536
2Sep 6, 2026 07:534,67748,751,37537,818,0001,008,0002,113,536
3Sep 6, 2026 07:534,67950,698,25537,814,0001,027,0002,113,536
4Sep 6, 2026 07:534,68048,729,02037,801,0001,046,0002,113,536
5Sep 6, 2026 07:534,69348,852,06337,939,0001,020,0002,113,536
6Sep 6, 2026 07:534,69348,798,77737,827,0001,128,0002,113,536
7Sep 6, 2026 07:534,69550,919,42837,877,0001,093,0002,113,536
8Sep 6, 2026 07:534,79258,503,85338,700,0001,079,0002,113,536
9Sep 6, 2026 07:534,81449,846,27838,949,0001,014,0002,113,536