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 1, 2026 16:35Hung T.NguyenHung T.NguyenScore: 58,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:3558,948507,948,410488,272,0001,000,0002,306,048
2May 1, 2026 16:3558,971507,360,764487,464,0001,997,0002,379,776
3May 1, 2026 16:3558,978508,858,665487,520,0001,998,0002,310,144
4May 1, 2026 16:3558,990508,172,911487,624,0001,998,0002,363,392
5May 1, 2026 16:3558,999511,203,733487,694,0001,998,0002,371,584
6May 1, 2026 16:3559,030503,505,203488,957,000999,0002,367,488
7May 1, 2026 16:3559,065508,793,900489,247,0001,000,0002,293,760
8May 1, 2026 16:3559,069511,724,141490,278,00002,297,856
9May 1, 2026 16:3559,085508,132,571490,407,00002,371,584