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 19, 2025 15:36Brandon TangBrandon TangScore: 55,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 15:3655,031485,019,275454,762,0001,998,0002,371,584
2Mar 19, 2025 15:3655,032482,810,760453,770,0002,998,0002,371,584
3Mar 19, 2025 15:3655,070483,283,814454,077,0003,000,0002,301,952