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,270Success
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,16181,564,11457,419,0002,014,0002,269,184
2Nov 4, 2025 09:557,16889,130,65159,492,00002,277,376
3Nov 4, 2025 09:557,17487,286,95258,532,0001,009,0002,523,136
4Nov 4, 2025 09:557,27088,691,44059,340,0001,005,0002,285,568
5Nov 4, 2025 09:557,29692,234,48259,546,0001,009,0002,285,568
6Nov 4, 2025 09:557,29891,652,96559,567,0001,009,0002,269,184