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 listOct 20, 2023 18:45Monadic CatMonadic CatScore: 61,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2023 18:4461,859576,285,112513,429,52202,273,280
2Oct 20, 2023 18:4561,863580,197,432513,458,89302,273,280
3Oct 20, 2023 18:4761,883578,799,170513,629,52002,269,184
4Oct 20, 2023 18:4761,887586,685,417513,662,51802,277,376
5Oct 20, 2023 18:4461,888582,795,491513,670,85902,273,280
6Oct 20, 2023 18:4561,916583,092,789513,899,73402,260,992
7Oct 20, 2023 18:4761,919578,206,740513,927,41402,265,088
8Oct 20, 2023 18:4461,930591,106,947514,021,98602,273,280
9Oct 20, 2023 18:4561,977583,580,434514,409,77402,256,896