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 5, 2024 13:46Aleksey ZhakovAleksey ZhakovScore: 178,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2024 13:43178,7641,559,885,1911,483,744,51602,244,608
2May 5, 2024 13:43178,8171,551,552,2621,484,177,47502,236,416
3May 5, 2024 13:46178,8181,540,123,7751,484,193,10302,236,416
4May 5, 2024 13:43178,8291,543,319,6131,484,283,87602,244,608
5May 5, 2024 13:46178,8631,541,669,4151,484,564,78402,248,704
6May 5, 2024 13:46178,8641,550,245,7651,484,574,07402,232,320