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 listFeb 17, 2026 19:08wnwnScore: 7,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:087,36587,413,87059,124,0002,004,0002,465,792
2Feb 17, 2026 19:087,46284,721,90558,935,0002,996,0002,408,448
3Feb 17, 2026 19:087,50888,512,15060,310,0002,010,0002,453,504
4Feb 17, 2026 19:087,54091,427,23759,552,0003,028,0002,408,448
5Feb 17, 2026 19:087,56392,471,05058,791,0003,985,0002,478,080
6Feb 17, 2026 19:087,56788,000,36861,808,000996,0002,437,120
7Feb 17, 2026 19:087,57189,579,52758,784,0004,054,0002,408,448
8Feb 17, 2026 19:087,57986,029,61559,909,0002,995,0002,412,544
9Feb 17, 2026 19:087,61687,588,55960,200,0003,010,0002,412,544
10Feb 17, 2026 19:087,66586,801,91259,640,0003,976,0002,453,504
11Feb 17, 2026 19:087,70585,931,96560,955,0002,997,0002,416,640
12Feb 17, 2026 19:087,77695,576,14661,517,0003,025,0002,301,952