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 21, 2025 21:38Adam FolwarcznyAdam FolwarcznyScore: 482,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 21:42476,4623,976,523,5282,045,778,0001,908,860,0002,428,928
2Aug 21, 2025 21:42476,5263,978,275,9702,035,543,0001,919,626,0002,531,328
3Aug 21, 2025 21:38479,7484,013,577,3502,017,434,0001,964,475,0002,428,928
4Aug 21, 2025 21:42482,4204,035,110,1422,027,525,0001,976,563,0002,424,832
5Aug 21, 2025 21:38484,9074,054,593,3812,013,364,0002,011,366,0002,420,736
6Aug 21, 2025 21:38490,8004,098,583,1252,033,823,0002,039,819,0002,531,328