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 11, 2026 07:54wnwnScore: 3,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:543,33737,232,98126,686,0001,018,0002,113,536
2May 11, 2026 07:543,47237,623,38328,822,00002,113,536
3May 11, 2026 07:543,49739,114,71929,027,00002,113,536
4May 11, 2026 07:543,50040,011,71629,051,00002,113,536
5May 11, 2026 07:543,50037,812,18229,056,00002,113,536
6May 11, 2026 07:543,50638,637,81828,081,0001,027,0002,113,536
7May 11, 2026 07:543,51339,695,53728,024,0001,141,0002,113,536
8May 11, 2026 07:543,51638,971,50128,177,0001,008,0002,113,536
9May 11, 2026 07:543,52537,481,48528,120,0001,141,0002,113,536