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 7, 2026 20:23neel-bhavsarneel-bhavsarError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:230683,302,851522,597,000150,638,00020,480expected "53689548224694122 ", got "53689548098217510 "
2Sep 7, 2026 20:230686,247,566525,903,000150,282,00020,480expected "53688773415514953 ", got "53688773344113737 "
3Sep 7, 2026 20:2381,165683,683,885522,856,000150,819,00020,480