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 6, 2026 16:26Danylo MocherniukDanylo MocherniukScore: 6,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 16:266,01673,880,70047,939,0001,997,0002,293,760
2Apr 6, 2026 16:266,02271,720,92147,981,0001,999,0002,293,760
3Apr 6, 2026 16:266,03872,533,60548,108,0002,004,0002,293,760
4Apr 6, 2026 16:266,04073,226,15548,126,0002,005,0002,498,560
5Apr 6, 2026 16:266,05371,091,28047,228,0003,014,0002,293,760
6Apr 6, 2026 16:266,08775,869,24949,508,0001,010,0002,404,352