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 11, 2026 07:34Danylo MocherniukDanylo MocherniukScore: 4,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 07:344,49859,681,70235,313,0002,017,0002,297,856
2Apr 11, 2026 07:344,51659,883,19335,458,0002,026,0002,392,064
3Apr 11, 2026 07:344,58864,421,53235,077,0003,006,0002,469,888
4Apr 11, 2026 07:344,60359,348,52735,192,0003,016,0002,387,968
5Apr 11, 2026 07:344,72266,284,45636,175,0003,014,0002,297,856
6Apr 11, 2026 07:344,73862,017,75638,315,0001,008,0002,400,256