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 27, 2026 04:51wnwnScore: 3,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:513,39442,047,73327,169,0001,006,0002,482,176
2Apr 27, 2026 04:513,40443,969,40728,256,00002,482,176
3Apr 27, 2026 04:513,44849,669,15527,600,0001,022,0002,490,368
4Apr 27, 2026 04:513,45146,503,75327,623,0001,023,0002,486,272
5Apr 27, 2026 04:513,48144,540,40826,903,0001,992,0002,478,080
6Apr 27, 2026 04:513,54846,691,53628,439,0001,015,0002,490,368
7Apr 27, 2026 04:513,55251,653,94928,468,0001,016,0002,486,272
8Apr 27, 2026 04:513,61743,151,55728,021,0002,001,0002,326,528
9Apr 27, 2026 04:513,66449,821,06128,450,0001,962,0002,551,808