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 5, 2026 12:53wnwnScore: 3,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:543,30335,887,74726,390,0001,032,0002,113,536
2Sep 5, 2026 12:543,37236,441,17026,982,0001,006,0002,113,536
3Sep 5, 2026 12:543,43636,966,93927,520,0001,004,0002,113,536
4Sep 5, 2026 12:543,45937,908,51427,674,0001,038,0002,113,536
5Sep 5, 2026 12:543,46837,956,97127,777,0001,011,0002,113,536
6Sep 5, 2026 12:543,46937,811,05627,790,0001,004,0002,113,536
7Sep 5, 2026 12:543,47937,973,44427,840,0001,036,0002,113,536
8Sep 5, 2026 12:543,48037,329,99427,858,0001,034,0002,113,536
9Sep 5, 2026 12:543,49638,242,22927,989,0001,029,0002,113,536