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 18, 2026 18:39wnwnScore: 7,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:396,40376,635,25251,140,0002,005,0002,523,136
2Feb 18, 2026 18:376,43276,348,13350,366,0003,021,0002,392,064
3Feb 18, 2026 18:376,43872,651,07551,416,0002,016,0002,293,760
4Feb 18, 2026 18:376,52275,093,98452,126,0002,004,0002,420,736
5Feb 18, 2026 18:396,53077,385,38652,190,0002,007,0002,506,752
6Feb 18, 2026 18:396,57878,160,84252,572,0002,022,0002,351,104
7Feb 18, 2026 18:377,37985,388,84458,231,0003,011,0002,469,888
8Feb 18, 2026 18:377,39481,307,22959,361,0002,012,0002,445,312
9Feb 18, 2026 18:377,45189,446,91358,854,0002,992,0002,416,640
10Feb 18, 2026 18:397,56890,976,86260,823,0001,994,0002,478,080
11Feb 18, 2026 18:397,57888,383,62660,904,0001,996,0002,322,432
12Feb 18, 2026 18:397,77088,135,94159,457,0005,038,0002,469,888