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 listOct 2, 2026 18:26Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:26043,531,83730,834,0003,650,00020,480expected "53687999882043434 ", got "M2 30639 us s0 "
2Oct 2, 2026 18:26043,788,20431,093,0003,679,00020,480expected "53691362974453381 ", got "M2 30858 us s0 "
3Oct 2, 2026 18:26044,434,55330,915,0004,411,00020,480expected "53684184942041218 ", got "M2 30732 us s0 "