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 listMay 9, 2026 13:14wnwnScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 13:153,39942,804,44027,181,0001,038,0002,486,272
2May 9, 2026 13:153,40443,111,36827,128,0001,128,0002,478,080
3May 9, 2026 13:153,40443,080,69327,182,0001,078,0002,478,080
4May 9, 2026 13:153,40744,344,72927,222,0001,059,0002,486,272
5May 9, 2026 13:153,41142,641,96327,247,0001,070,0002,482,176
6May 9, 2026 13:153,43042,452,13327,382,0001,089,0002,482,176
7May 9, 2026 13:153,56746,058,90728,552,0001,057,0002,478,080
8May 9, 2026 13:153,57148,057,57528,546,0001,099,0002,478,080
9May 9, 2026 13:153,59447,197,59528,757,0001,080,0002,482,176