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 10, 2026 11:37wnwnScore: 3,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:373,39043,056,50427,018,0001,120,0002,486,272
2May 10, 2026 11:373,39641,770,29627,152,0001,040,0002,478,080
3May 10, 2026 11:373,41142,484,22127,200,0001,113,0002,494,464
4May 10, 2026 11:373,45745,231,99327,606,0001,094,0002,473,984
5May 10, 2026 11:373,49342,954,31027,923,0001,077,0002,482,176
6May 10, 2026 11:373,56043,809,12728,459,0001,089,0002,494,464
7May 10, 2026 11:373,56643,051,78928,533,0001,067,0002,490,368
8May 10, 2026 11:373,56644,607,20228,535,0001,066,0002,482,176
9May 10, 2026 11:373,57643,006,53728,601,0001,084,0002,486,272