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 listFeb 6, 2025 09:05E SequeiraE SequeiraScore: 13,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 06:3813,394137,871,497108,166,0003,004,0002,289,664
2Feb 6, 2025 09:0513,395140,276,835109,173,0002,003,0002,322,432
3Dec 8, 2024 06:3813,396139,457,749109,181,0002,003,0002,289,664
4Dec 8, 2024 06:3813,398140,949,790108,200,0003,005,0002,289,664
5Feb 6, 2025 09:0513,413136,731,935108,317,0003,008,0002,289,664
6Feb 6, 2025 09:0513,425139,842,704109,419,0002,007,0002,289,664