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 listFeb 24, 2026 21:04wnwnScore: 5,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:045,31966,761,95142,144,0002,006,0002,482,176
2Feb 24, 2026 21:045,44868,902,28343,213,0002,009,0002,535,424
3Feb 24, 2026 21:048,92395,828,86972,057,0002,001,0002,535,424