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 listDec 19, 2024 18:03Javid izadiJavid izadiScore: 388,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 18:03387,0913,237,778,3973,143,905,00068,954,0002,363,392
2Dec 19, 2024 18:03388,0323,247,470,6303,152,719,00067,950,0002,281,472
3Dec 19, 2024 18:03391,0913,276,198,9723,185,090,00060,963,0002,285,568