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 listApr 19, 2026 05:09Yuriy LyfenkoYuriy LyfenkoScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 05:074,50355,547,61436,362,0001,010,0002,269,184
2Apr 19, 2026 05:074,51357,806,17936,446,0001,012,0002,478,080
3Apr 19, 2026 05:094,52665,543,15336,547,0001,015,0002,535,424
4Apr 19, 2026 05:094,55865,445,22336,839,000995,0002,310,144
5Apr 19, 2026 05:074,56068,890,36436,850,000995,0002,465,792
6Apr 19, 2026 05:094,56064,344,85036,852,000996,0002,473,984