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 25, 2025 07:59Ham-HamHam-HamScore: 87,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 07:5987,750758,513,707641,406,00086,919,0002,347,008
2Nov 25, 2025 08:0187,757755,844,316640,454,00087,925,0002,486,272
3Nov 25, 2025 08:0187,873756,539,820638,428,00090,918,0002,359,296
4Nov 25, 2025 07:5987,960757,730,776640,186,00089,885,0002,342,912
5Nov 25, 2025 07:5988,551763,273,183642,978,00091,996,0002,355,200
6Nov 25, 2025 08:0188,709761,660,540642,379,00093,909,0002,355,200