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 13, 2026 11:07wnwnScore: 4,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:074,02757,944,41432,414,0001,012,0002,490,368
2Apr 13, 2026 11:074,02860,248,62932,417,0001,013,0002,490,368
3Apr 13, 2026 11:074,03161,947,16632,445,0001,013,0002,277,376
4Apr 13, 2026 11:074,07760,003,29131,845,0001,990,0002,486,272
5Apr 13, 2026 11:074,07756,056,51131,846,0001,990,0002,277,376
6Apr 13, 2026 11:074,16061,199,26833,512,0001,015,0002,494,464
7Apr 13, 2026 11:074,16459,338,99233,547,0001,016,0002,494,464
8Apr 13, 2026 11:074,21460,435,35532,981,0001,998,0002,277,376
9Apr 13, 2026 11:074,24758,409,65333,239,0002,014,0002,277,376