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 6, 2026 21:04TonyTonyScore: 7,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 21:057,89375,265,14062,747,0002,772,0002,113,536
2Aug 6, 2026 21:057,90375,385,67362,784,0002,813,0002,113,536
3Aug 6, 2026 21:057,90575,504,57963,567,0002,047,0002,113,536
4Aug 6, 2026 21:057,90975,425,81262,919,0002,732,0002,113,536
5Aug 6, 2026 21:057,92175,512,28463,718,0002,033,0002,113,536
6Aug 6, 2026 21:057,92575,559,49662,981,0002,801,0002,113,536
7Aug 6, 2026 21:057,94675,710,71063,154,0002,804,0002,113,536
8Aug 6, 2026 21:057,96775,941,38064,037,0002,091,0002,113,536
9Aug 6, 2026 21:057,98275,966,15164,141,0002,113,0002,113,536