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 listJan 31, 2026 21:39olliecrowolliecrowScore: 6,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 21:396,04069,269,23346,121,0004,010,0002,347,008
2Jan 31, 2026 21:396,05472,946,56948,237,0002,009,0002,338,816
3Jan 31, 2026 21:396,06678,320,45144,308,0006,042,0002,330,624
4Jan 31, 2026 21:396,36382,205,94250,821,0001,992,0002,473,984
5Jan 31, 2026 21:396,37378,195,18051,902,000998,0002,265,088
6Jan 31, 2026 21:396,40175,607,55451,125,0002,004,0002,457,600