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 listMar 11, 2026 20:22Daniel MastalerzDaniel MastalerzScore: 7,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 20:227,71389,719,10161,015,0003,000,0002,285,568
2Mar 11, 2026 20:227,72187,099,84861,079,0003,003,0002,285,568
3Mar 11, 2026 20:227,72685,925,81862,124,0002,004,0002,285,568
4Mar 11, 2026 20:227,99386,758,44064,336,0002,010,0002,285,568
5Mar 11, 2026 20:228,00689,898,55064,438,0002,013,0002,338,816
6Mar 11, 2026 20:228,01188,946,68263,471,0003,022,0002,285,568