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 listOct 17, 2026 16:27timothygktimothygkScore: 35,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 16:3135,504305,525,406293,602,0001,087,0002,117,632stderr
2Oct 17, 2026 16:3135,523305,900,410293,747,0001,099,0002,117,632stderr
3Oct 17, 2026 16:3135,526306,286,208293,776,0001,096,0002,117,632stderr
4Oct 17, 2026 16:3135,531305,993,311293,807,0001,108,0002,117,632stderr
5Oct 17, 2026 16:3135,537306,089,844293,950,0001,010,0002,117,632stderr
6Oct 17, 2026 16:3135,542306,579,513293,995,0001,005,0002,117,632stderr
7Oct 17, 2026 16:3135,546306,431,818294,036,0001,002,0002,117,632stderr
8Oct 17, 2026 16:3136,108310,621,084298,619,0001,085,0002,117,632stderr
9Oct 17, 2026 16:3136,202312,032,308299,475,0001,005,0002,117,632stderr