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 22:23Pavel SkripkinPavel SkripkinScore: 52,421Success
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 22:2352,207459,918,173432,319,0001,000,0002,289,664
2Jan 7, 2026 22:2352,287456,576,142431,982,0001,999,0002,285,568
3Jan 7, 2026 22:2352,287455,143,780431,984,0001,999,0002,289,664
4Jan 7, 2026 22:2352,366459,495,449433,641,000999,0002,359,296
5Jan 7, 2026 22:2352,421459,804,090435,094,00002,289,664
6Jan 7, 2026 22:2352,422458,368,910433,103,0002,000,0002,375,680
7Jan 7, 2026 22:2352,507464,978,865433,813,0001,999,0002,371,584
8Jan 7, 2026 22:2352,546457,867,577435,129,0001,000,0002,465,792
9Jan 7, 2026 22:2352,565461,139,739436,288,00002,469,888