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 10, 2026 14:45boop34boop34Score: 9,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 14:489,12486,056,26074,686,0001,050,0002,113,536
2Sep 10, 2026 14:489,15487,074,40874,895,0001,088,0002,113,536
3Sep 10, 2026 14:489,16086,372,16574,960,0001,068,0002,113,536
4Sep 10, 2026 14:489,19586,685,26075,246,0001,077,0002,113,536
5Sep 10, 2026 14:489,20086,632,17575,314,0001,048,0002,113,536
6Sep 10, 2026 14:489,22687,697,63375,504,0001,076,0002,113,536
7Sep 10, 2026 14:489,23186,955,94275,582,0001,039,0002,113,536
8Sep 10, 2026 14:489,29688,217,32776,108,0001,051,0002,113,536
9Sep 10, 2026 14:489,32887,724,09276,353,0001,077,0002,113,536