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 listNov 5, 2025 11:03caandocaandoScore: 5,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 11:035,57967,984,18744,294,0002,013,0002,285,568
2Nov 5, 2025 11:035,58167,839,28244,311,0002,014,0002,285,568
3Nov 5, 2025 11:035,62072,927,45045,629,0001,013,0002,514,944
4Nov 5, 2025 11:035,68973,410,41045,209,0002,009,0002,514,944
5Nov 5, 2025 11:035,69470,813,88746,259,0001,005,0002,285,568
6Nov 5, 2025 11:035,72876,481,71146,535,0001,011,0002,519,040