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 2, 2026 17:53CheckHarryCheckHarryScore: 8,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:548,07877,036,68165,920,0001,130,0002,113,536
2Sep 2, 2026 17:548,09778,064,03065,991,0001,219,0002,113,536
3Sep 2, 2026 17:548,10677,467,62366,138,0001,148,0002,113,536
4Sep 2, 2026 17:548,65982,012,15770,713,0001,161,0002,113,536
5Sep 2, 2026 17:548,95684,391,23373,188,0001,155,0002,113,536
6Sep 2, 2026 17:548,97885,302,82673,267,0001,257,0002,113,536
7Sep 2, 2026 17:548,98785,369,90273,364,0001,230,0002,113,536
8Sep 2, 2026 17:548,99984,777,76473,544,0001,152,0002,113,536
9Sep 2, 2026 17:549,04585,116,38073,929,0001,149,0002,113,536