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 listAug 2, 2026 21:50TonyTonyScore: 15,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:5015,010134,469,711123,505,0001,081,0002,113,536
2Aug 2, 2026 21:5015,017134,476,474123,553,0001,090,0002,113,536
3Aug 2, 2026 21:5015,020134,497,975123,658,0001,014,0002,113,536
4Aug 2, 2026 21:5015,023134,435,283123,684,0001,007,0002,113,536
5Aug 2, 2026 21:5015,027134,592,679123,648,0001,077,0002,113,536
6Aug 2, 2026 21:5015,031134,533,930123,756,0001,002,0002,113,536
7Aug 2, 2026 21:5015,033134,652,425123,691,0001,083,0002,113,536
8Aug 2, 2026 21:5015,044134,796,160123,788,0001,083,0002,113,536
9Aug 2, 2026 21:5015,054134,792,329123,776,0001,174,0002,113,536