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 listNov 5, 2025 11:05caandocaandoScore: 5,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 11:055,47872,885,11945,471,00002,285,568
2Nov 5, 2025 11:055,49671,979,56744,605,0001,013,0002,523,136
3Nov 5, 2025 11:055,53370,992,92543,932,0001,996,0002,285,568
4Nov 5, 2025 11:055,55273,854,69245,079,0001,001,0002,285,568
5Nov 5, 2025 11:055,55566,844,21245,104,0001,002,0002,285,568
6Nov 5, 2025 11:055,55767,631,03645,125,0001,002,0002,285,568
7Nov 5, 2025 11:055,56567,817,68744,181,0002,008,0002,285,568
8Nov 5, 2025 11:055,56872,875,87644,209,0002,009,0002,285,568
9Nov 5, 2025 11:055,58067,170,52444,303,0002,013,0002,269,184
10Nov 5, 2025 11:055,61369,553,83045,572,0001,012,0002,519,040
11Nov 5, 2025 11:055,67370,795,56946,086,0001,001,0002,285,568
12Nov 5, 2025 11:055,67869,251,53545,124,0002,005,0002,285,568