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 listApr 20, 2026 13:47BenBenScore: 37,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 13:4837,908341,466,256261,702,00052,939,0002,252,800
2Apr 20, 2026 13:4837,916338,173,674249,769,00064,939,0002,256,896
3Apr 20, 2026 13:4838,048341,546,682257,839,00057,963,0002,506,752