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 21, 2025 13:18vahookvahookScore: 4,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2025 13:184,73066,256,17637,243,0002,013,0002,273,280
2May 21, 2025 13:184,73162,123,31335,242,0004,027,0002,527,232
3May 21, 2025 13:184,74162,417,38537,333,0002,018,0002,273,280
4May 21, 2025 13:184,77068,202,31436,550,0003,045,0002,433,024
5May 21, 2025 13:184,77562,870,87336,584,0003,048,0002,469,888
6May 21, 2025 13:184,78069,064,62337,637,0002,034,0002,437,120
7May 21, 2025 13:184,81362,556,18437,952,0001,997,0002,273,280
8May 21, 2025 13:184,85461,449,42938,272,0002,014,0002,273,280
9May 21, 2025 13:184,88166,608,75038,491,0002,025,0002,437,120
10May 21, 2025 13:184,88561,881,69937,502,0003,040,0002,424,832
11May 21, 2025 13:184,89069,061,94637,547,0003,044,0002,273,280
12May 21, 2025 13:184,89464,011,18038,591,0002,031,0002,273,280