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 listMay 20, 2026 06:05M-RochatM-RochatScore: 14,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0613,991126,376,871113,798,0002,335,0002,113,536
2May 20, 2026 06:0613,998127,061,377113,824,0002,364,0002,113,536
3May 20, 2026 06:0614,019125,944,701114,015,0002,347,0002,113,536
4May 20, 2026 06:0614,076127,751,128114,805,0002,034,0002,113,536
5May 20, 2026 06:0614,079126,397,644114,796,0002,061,0002,113,536
6May 20, 2026 06:0614,086126,298,284114,849,0002,065,0002,113,536
7May 20, 2026 06:0614,118129,272,172115,124,0002,061,0002,113,536
8May 20, 2026 06:0614,122128,710,077115,140,0002,075,0002,113,536
9May 20, 2026 06:0614,130128,101,134115,199,0002,083,0002,113,536