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 listNov 14, 2024 22:37zielajzielajScore: 4,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 22:373,99051,169,13932,116,0001,003,0002,273,280
2Nov 14, 2024 22:373,99060,676,04832,114,0001,003,0002,359,296
3Nov 14, 2024 22:373,99259,413,16632,129,0001,004,0002,367,488
4Nov 14, 2024 22:373,99257,864,03231,125,0002,008,0002,359,296
5Nov 14, 2024 22:374,00458,007,49031,217,0002,014,0002,273,280
6Nov 14, 2024 22:374,01353,205,10632,303,0001,009,0002,273,280
7Nov 14, 2024 22:374,01555,715,32631,306,0002,019,0002,527,232
8Nov 14, 2024 22:374,02055,207,73133,362,00002,363,392
9Nov 14, 2024 22:374,03262,438,83833,465,00002,359,296
10Nov 14, 2024 22:374,04258,241,56932,533,0001,016,0002,535,424
11Nov 14, 2024 22:374,06558,551,86431,756,0001,984,0002,273,280
12Nov 14, 2024 22:374,07856,652,52432,851,000995,0002,277,376