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 19, 2026 04:40Joel ChongJoel ChongScore: 48,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 04:4048,534423,142,222401,833,000999,0002,269,184
2Mar 19, 2026 04:4048,658426,942,209402,862,000999,0002,277,376
3Mar 19, 2026 04:4048,683427,848,007403,065,0001,000,0002,285,568
4Mar 19, 2026 04:4048,689428,170,531402,123,0001,995,0002,285,568
5Mar 19, 2026 04:4048,711436,557,580403,304,000998,0002,265,088
6Mar 19, 2026 04:4048,718426,874,389403,358,0001,000,0002,277,376
7Mar 19, 2026 04:4048,742430,293,898403,562,000998,0002,285,568
8Mar 19, 2026 04:4048,750429,090,136402,630,0001,998,0002,260,992
9Mar 19, 2026 04:4048,760427,701,853402,713,0001,998,0002,523,136