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 listSep 24, 2026 04:14wnwnScore: 3,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:153,50237,765,46528,065,0001,006,0002,113,536
2Sep 24, 2026 04:153,50537,957,66128,061,0001,037,0002,113,536
3Sep 24, 2026 04:153,52539,402,74828,248,0001,012,0002,113,536
4Sep 24, 2026 04:153,52738,040,01328,236,0001,042,0002,113,536
5Sep 24, 2026 04:153,68939,690,05829,582,0001,038,0002,113,536
6Sep 24, 2026 04:153,69140,035,96629,634,0001,003,0002,113,536
7Sep 24, 2026 04:153,69440,081,96629,643,0001,018,0002,113,536
8Sep 24, 2026 04:153,69739,520,70129,654,0001,038,0002,113,536
9Sep 24, 2026 04:153,73240,376,85629,975,0001,006,0002,113,536