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, 2025 15:34caandocaandoScore: 5,984Success
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, 2025 15:345,94777,460,76347,347,0002,014,0002,519,040
2Oct 5, 2025 15:345,96275,666,98048,475,0001,009,0002,285,568
3Oct 5, 2025 15:345,96676,917,22648,511,0001,010,0002,285,568
4Oct 5, 2025 15:345,97879,732,29348,609,0001,012,0002,285,568
5Oct 5, 2025 15:345,98077,938,25348,624,0001,013,0002,277,376
6Oct 5, 2025 15:345,98075,967,87048,619,0001,012,0002,281,472
7Oct 5, 2025 15:345,98477,193,87348,656,0001,013,0002,510,848
8Oct 5, 2025 15:346,00380,928,48947,829,0001,992,0002,269,184
9Oct 5, 2025 15:346,00476,065,89647,839,0001,993,0002,285,568
10Oct 5, 2025 15:346,07571,551,10049,412,0001,008,0002,285,568
11Oct 5, 2025 15:346,12379,714,60848,832,0001,993,0002,285,568
12Oct 5, 2025 15:346,13676,804,11748,932,0001,997,0002,285,568