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 listOct 5, 2026 02:15FrederickFrederickScore: 8,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:158,67582,352,52869,884,0002,123,0002,117,632
2Oct 5, 2026 02:158,70082,705,22270,083,0002,131,0002,117,632
3Oct 5, 2026 02:158,76283,815,28070,596,0002,131,0002,117,632
4Oct 5, 2026 02:158,78183,594,23070,752,0002,135,0002,117,632
5Oct 5, 2026 02:158,81183,538,77171,010,0002,129,0002,117,632
6Oct 5, 2026 02:158,81884,368,31171,183,0002,014,0002,117,632
7Oct 5, 2026 02:158,82683,725,29871,147,0002,113,0002,117,632
8Oct 5, 2026 02:158,84183,808,64671,257,0002,131,0002,117,632
9Oct 5, 2026 02:158,99085,745,02172,511,0002,108,0002,117,632