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 listJul 6, 2023 09:19Huy Duc LeHuy Duc LeScore: 1,637,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2023 09:191,637,05813,657,233,91813,587,578,77502,244,608
2Jul 6, 2023 09:191,637,41313,652,230,74413,590,528,16202,252,800
3Jul 6, 2023 09:191,640,92313,683,515,92713,619,660,63002,269,184