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 4, 2025 09:55Tejas G.Tejas G.Score: 7,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 09:557,20686,426,14959,809,00002,265,088
2Nov 4, 2025 09:557,21083,461,72558,848,000997,0002,260,992
3Nov 4, 2025 09:557,21281,341,98657,864,0001,995,0002,285,568
4Nov 4, 2025 09:557,28382,322,54560,446,00002,265,088
5Nov 4, 2025 09:557,28485,278,06260,454,00002,285,568
6Nov 4, 2025 09:557,35888,937,97259,067,0002,002,0002,285,568