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 listJan 3, 2026 03:05Josu San MartinJosu San MartinScore: 6,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 03:055,92371,694,20548,157,0001,003,0002,277,376
2Jan 3, 2026 03:046,00477,820,40448,837,000996,0002,400,256
3Jan 3, 2026 03:046,04672,817,24449,178,0001,003,0002,404,352
4Jan 3, 2026 03:046,08871,852,51349,523,0001,010,0002,404,352
5Jan 3, 2026 03:056,11978,128,60049,793,000995,0002,523,136
6Jan 3, 2026 03:046,13777,885,90748,939,0001,997,0002,269,184
7Jan 3, 2026 03:056,27578,690,07550,083,0002,003,0002,273,280
8Jan 3, 2026 03:056,30182,739,56252,296,00002,396,160
9Jan 3, 2026 03:046,31279,183,03751,383,0001,007,0002,277,376
10Jan 3, 2026 03:056,33074,957,68151,531,0001,010,0002,392,064
11Jan 3, 2026 03:056,36081,644,90451,789,000995,0002,285,568
12Jan 3, 2026 03:046,36477,833,42550,828,0001,993,0002,277,376