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 15, 2026 07:55eldon-chungeldon-chungScore: 37,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 07:5537,219332,335,023306,920,0001,999,0002,285,568
2Mar 15, 2026 07:5537,221330,016,527306,932,0001,999,0002,269,184
3Mar 15, 2026 07:5537,266332,960,742308,305,0001,000,0002,519,040
4Mar 15, 2026 07:5537,618335,360,206310,231,0002,001,0002,269,184
5Mar 15, 2026 07:5537,636335,402,169310,380,0001,996,0002,269,184
6Mar 15, 2026 07:5537,637338,968,697311,385,0001,001,0002,285,568
7Mar 15, 2026 07:5537,641344,171,754311,422,0001,001,0002,285,568
8Mar 15, 2026 07:5537,645343,317,819310,454,0001,996,0002,277,376
9Mar 15, 2026 07:5537,654338,467,913311,527,000998,0002,277,376