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 24, 2026 06:38wnwnScore: 4,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 06:434,60546,936,99227,866,00010,362,00020,480
2Sep 24, 2026 06:434,68348,279,82228,779,00010,098,00020,480
3Sep 24, 2026 06:434,74248,778,21829,134,00010,230,00020,480
4Sep 24, 2026 06:434,74948,256,87527,821,00011,598,00020,480
5Sep 24, 2026 06:434,75648,874,48329,310,00010,173,00020,480
6Sep 24, 2026 06:434,76648,374,08528,413,00011,146,0002,113,536
7Sep 24, 2026 06:434,76949,199,25729,025,00010,558,0002,113,536
8Sep 24, 2026 06:434,78348,499,92528,870,00010,833,00020,480
9Sep 24, 2026 06:434,98950,844,42229,422,00011,993,00020,480