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 listAug 11, 2026 10:32RabenknechtRabenknechtScore: 71,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 10:3271,674604,910,218593,871,0001,030,0002,113,536
2Aug 11, 2026 10:3271,706606,010,033594,160,0001,001,0002,113,536
3Aug 11, 2026 10:3271,710605,953,173594,088,0001,105,0002,113,536
4Aug 11, 2026 10:3271,711606,018,843594,124,0001,078,0002,113,536
5Aug 11, 2026 10:3271,723606,116,261594,251,0001,053,0002,113,536
6Aug 11, 2026 10:3271,743605,589,563594,395,0001,080,0002,113,536
7Aug 11, 2026 10:3271,744605,901,354594,353,0001,123,0002,113,536
8Aug 11, 2026 10:3271,765606,497,743594,652,0001,001,0002,113,536
9Aug 11, 2026 10:3271,766606,405,773594,612,0001,046,0002,113,536