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 listJan 7, 2026 11:43Petsku01Petsku01Score: 67,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 12:0467,319590,247,454557,745,000999,0002,355,200
2Jan 7, 2026 12:0467,320588,662,074556,759,0001,999,0002,355,200
3Jan 7, 2026 11:4367,333584,707,864556,861,0001,999,0002,535,424
4Jan 7, 2026 11:4067,337587,284,265557,901,000999,0002,539,520
5Jan 7, 2026 11:4067,350588,218,654557,008,0002,000,0002,543,616
6Jan 7, 2026 11:4367,350582,433,596557,006,0002,000,0002,355,200
7Jan 7, 2026 11:4367,354589,192,179557,038,0002,000,0002,359,296
8Jan 7, 2026 12:0467,361592,094,047557,095,0002,000,0002,543,616
9Jan 7, 2026 11:4367,366585,958,735558,137,0001,000,0002,543,616
10Jan 7, 2026 11:4367,387584,793,818559,315,00002,510,848
11Jan 7, 2026 11:4367,399586,129,547557,407,0002,001,0002,371,584
12Jan 7, 2026 11:4067,437585,304,579556,731,0002,998,0002,531,328