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 3, 2025 07:16Rohan KapurRohan KapurScore: 60,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 07:1660,321528,780,057498,663,0001,998,0002,289,664
2Jan 3, 2025 07:1660,331526,003,392499,745,000999,0002,289,664
3Jan 3, 2025 07:1660,468528,214,893500,886,000999,0002,289,664
4Jan 3, 2025 07:1660,494527,303,750500,104,0002,000,0002,371,584
5Jan 3, 2025 07:1660,501531,489,987500,162,0002,000,0002,285,568
6Jan 3, 2025 07:1660,572530,804,346500,746,0001,998,0002,285,568
7Jan 3, 2025 07:1660,573526,650,608501,757,000999,0002,289,664
8Jan 3, 2025 07:1660,750530,355,913503,224,0001,000,0002,289,664
9Jan 3, 2025 07:1660,764532,665,268503,344,0001,000,0002,363,392