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 listSep 7, 2026 20:33neel-bhavsarneel-bhavsarScore: 75,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:3475,691638,570,011478,665,000149,576,00020,480
2Sep 7, 2026 20:3475,695638,253,493477,659,000150,610,00020,480
3Sep 7, 2026 20:3475,718639,177,207477,880,000150,585,00020,480
4Sep 7, 2026 20:3475,756639,528,448477,588,000151,188,00020,480
5Sep 7, 2026 20:3475,761638,782,923478,098,000150,719,00020,480
6Sep 7, 2026 20:3475,988640,667,806479,766,000150,939,00020,480
7Sep 7, 2026 20:3476,041641,137,291479,364,000151,781,00020,480
8Sep 7, 2026 20:3476,042641,128,529480,961,000150,190,00020,480
9Sep 7, 2026 20:3476,051641,256,554480,147,000151,078,00020,480