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 listNov 3, 2025 09:22AntonAntonScore: 77,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 09:2276,615662,293,104553,920,00081,988,0002,306,048
2Nov 3, 2025 09:2276,851666,803,629539,883,00097,978,0002,490,368
3Nov 3, 2025 09:2277,230665,792,582545,005,00096,000,0002,478,080
4Nov 3, 2025 09:2277,259669,763,246557,214,00084,032,0002,297,856
5Nov 3, 2025 09:2277,310666,428,400550,723,00090,954,0002,297,856
6Nov 3, 2025 09:2277,358668,189,847549,063,00093,010,0002,482,176
7Nov 3, 2025 09:2277,374671,609,466550,179,00092,029,0002,543,616
8Nov 3, 2025 09:2277,592669,699,185533,010,000111,002,0002,490,368
9Nov 3, 2025 09:2277,984677,744,596546,223,000101,041,0002,297,856