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 1, 2026 11:17George SeabridgeGeorge SeabridgeScore: 7,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 11:176,39263,052,58852,049,0001,011,0002,113,536
2Aug 1, 2026 11:176,40363,140,74952,069,0001,076,0002,113,536
3Aug 1, 2026 11:176,41663,224,80052,247,0001,008,0002,113,536
4Aug 1, 2026 11:176,42363,251,04652,233,0001,078,0002,113,536
5Aug 1, 2026 11:177,67073,719,46962,573,0001,089,0002,113,536
6Aug 1, 2026 11:177,68173,813,88562,541,0001,216,0002,113,536
7Aug 1, 2026 11:177,69975,609,04562,799,0001,103,0002,113,536
8Aug 1, 2026 11:177,70273,875,03862,839,0001,091,0002,113,536
9Aug 1, 2026 11:177,71674,037,35862,879,0001,169,0002,113,536