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 14, 2024 10:45alexeyalexeyScore: 251,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2023 20:00250,2142,132,603,5912,076,774,97202,203,648
2Mar 6, 2023 20:00250,3842,130,448,1032,078,188,29302,211,840
3Mar 6, 2023 20:00250,4262,141,578,2622,078,539,03402,215,936
4Sep 14, 2024 10:45251,0032,105,742,6341,999,349,00083,972,0002,416,640
5Sep 14, 2024 10:45251,2512,113,298,1161,991,414,00093,972,0002,367,488
6Sep 14, 2024 10:45251,3372,115,551,6342,002,131,00083,963,0002,330,624