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 26, 2026 15:16wnwnScore: 4,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 15:164,22455,933,36133,055,0002,003,0002,498,560
2Mar 26, 2026 15:164,23354,991,01233,131,0002,007,0002,277,376
3Mar 26, 2026 15:164,23660,614,30033,147,0002,008,0002,490,368
4Mar 26, 2026 15:164,24260,365,36133,199,0002,012,0002,502,656
5Mar 26, 2026 15:164,24356,645,67333,204,0002,012,0002,498,560
6Mar 26, 2026 15:164,25256,446,53233,274,0002,016,0002,490,368
7Mar 26, 2026 15:164,25455,297,51334,303,0001,008,0002,490,368
8Mar 26, 2026 15:164,25755,677,25834,320,0001,009,0002,273,280
9Mar 26, 2026 15:164,26062,700,50734,350,0001,010,0002,498,560
10Mar 26, 2026 15:164,27365,431,72934,451,0001,013,0002,277,376
11Mar 26, 2026 15:164,31761,115,72233,839,0001,990,0002,277,376
12Mar 26, 2026 15:164,59962,715,94036,166,0002,009,0002,277,376