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 11, 2026 14:12Pavel SkripkinPavel SkripkinScore: 34,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 14:1234,853312,364,472288,279,0001,000,0002,437,120
2Jan 11, 2026 14:1234,919312,024,604287,830,0001,998,0002,543,616
3Jan 11, 2026 14:1234,923317,489,358287,860,0001,999,0002,281,472
4Jan 11, 2026 14:1234,933309,258,200287,942,0001,999,0002,428,928
5Jan 11, 2026 14:1234,987308,584,270289,387,0001,001,0002,543,616
6Jan 11, 2026 14:1235,005317,928,062289,544,0001,001,0002,281,472
7Jan 11, 2026 14:1235,024312,847,786289,701,000998,0002,281,472
8Jan 11, 2026 14:1235,024318,548,348289,705,000998,0002,281,472
9Jan 11, 2026 14:1235,026322,332,551288,718,0001,998,0002,543,616