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 04:19Tejas G.Tejas G.Score: 9,955Success
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 04:199,737107,572,90979,819,000997,0002,269,184
2Nov 4, 2025 04:199,744108,617,10279,879,000998,0002,285,568
3Nov 4, 2025 04:199,847117,198,54680,720,0001,009,0002,285,568
4Nov 4, 2025 04:199,955107,952,26082,627,00002,285,568
5Nov 4, 2025 04:1910,000106,992,57681,002,0002,000,0002,523,136
6Nov 4, 2025 04:1910,002108,488,72781,016,0002,000,0002,285,568