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 listSep 29, 2026 04:03Karthik ReddyKarthik ReddyScore: 4,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 04:034,45847,308,47935,874,0001,135,0002,113,536
2Sep 29, 2026 04:034,46147,312,99135,909,0001,123,0002,113,536
3Sep 29, 2026 04:034,49147,587,43436,144,0001,132,0002,117,632
4Sep 29, 2026 04:034,55748,200,03436,672,0001,157,0002,113,536
5Sep 29, 2026 04:034,61248,619,57337,145,0001,136,0002,113,536
6Sep 29, 2026 04:034,62548,802,40837,263,0001,132,0002,113,536
7Sep 29, 2026 04:034,62848,879,76037,275,0001,141,0002,113,536
8Sep 29, 2026 04:034,63748,839,28337,363,0001,130,0002,113,536
9Sep 29, 2026 04:034,65348,913,44937,489,0001,133,0002,113,536