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 listApr 22, 2026 11:07wnwnScore: 3,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 11:083,43047,456,73827,456,0001,016,0002,482,176
2Apr 22, 2026 11:083,43346,679,78927,482,0001,017,0002,330,624
3Apr 22, 2026 11:083,46146,083,39926,750,0001,981,0002,469,888
4Apr 22, 2026 11:083,46444,296,97827,728,0001,026,0002,490,368
5Apr 22, 2026 11:083,49442,878,52627,003,0002,000,0002,478,080
6Apr 22, 2026 11:083,51247,538,96328,148,0001,005,0002,490,368
7Apr 22, 2026 11:083,63846,723,37929,197,0001,006,0002,482,176
8Apr 22, 2026 11:083,64144,899,58929,220,0001,007,0002,486,272
9Apr 22, 2026 11:083,64143,954,41829,214,0001,007,0002,482,176