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 listMar 21, 2026 13:10olliecrowolliecrowScore: 6,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:105,99877,273,47946,798,0002,987,0002,457,600
2Mar 21, 2026 13:106,05777,547,37347,254,0003,016,0002,502,656
3Mar 21, 2026 13:106,27882,718,47647,097,0005,010,0002,428,928