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 4, 2026 16:34juniskewljuniskewlScore: 54,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:3453,858471,913,640445,019,0002,000,0002,265,088
2Mar 4, 2026 16:3453,966471,280,585445,916,0001,999,0002,523,136
3Mar 4, 2026 16:3453,973469,968,603446,981,000999,0002,285,568
4Mar 4, 2026 16:3454,012472,766,735448,301,00002,293,760
5Mar 4, 2026 16:3454,053475,711,424446,644,0001,998,0002,273,280
6Mar 4, 2026 16:3454,138472,900,574448,348,0001,000,0002,285,568
7Mar 4, 2026 16:3454,261476,116,285449,363,0001,000,0002,285,568
8Mar 4, 2026 16:3454,267469,868,436450,414,00002,383,872
9Mar 4, 2026 16:3454,293480,286,627448,636,0001,998,0002,265,088