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 17, 2026 14:27shartgepettoshartgepettoScore: 7,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:277,73386,571,89261,173,0003,008,0002,457,600
2Mar 17, 2026 14:277,74887,048,65860,293,0004,019,0002,285,568
3Mar 17, 2026 14:277,88088,339,76862,387,0003,018,0002,428,928