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 13:12wnwnScore: 3,441Success
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 13:153,28835,688,00926,286,0001,008,0002,113,536
2Sep 5, 2026 13:153,30035,788,60326,349,0001,045,0002,113,536
3Sep 5, 2026 13:153,30736,037,73926,433,0001,020,0002,113,536
4Sep 5, 2026 13:153,31535,911,09726,478,0001,038,0002,113,536
5Sep 5, 2026 13:153,44137,654,35027,504,0001,057,0002,113,536
6Sep 5, 2026 13:153,45037,011,72527,613,0001,030,0002,113,536
7Sep 5, 2026 13:153,45237,046,68527,622,0001,032,0002,113,536
8Sep 5, 2026 13:153,45336,997,19527,634,0001,034,0002,113,536
9Sep 5, 2026 13:153,53138,402,04528,278,0001,030,0002,113,536