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 13, 2026 17:34caandocaandoScore: 6,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 17:424,61366,685,50336,277,0002,015,0002,490,368
2Mar 13, 2026 17:424,65268,147,16137,595,0001,016,0002,277,376
3Mar 13, 2026 17:424,65570,749,86137,624,0001,016,0002,285,568
4Mar 13, 2026 17:346,89379,943,04455,203,0002,007,0002,494,464
5Mar 13, 2026 17:416,89680,943,83355,225,0002,008,0002,482,176
6Mar 13, 2026 17:416,91482,930,55355,405,0001,978,0002,289,664
7Mar 13, 2026 17:346,96581,913,34756,815,000996,0002,285,568
8Mar 13, 2026 17:416,96884,752,09256,836,000997,0002,285,568
9Mar 13, 2026 17:347,05079,461,86257,506,0001,008,0002,285,568