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 11, 2024 02:01zielajzielajScore: 6,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 02:016,07674,189,37850,428,00002,428,928
2Nov 11, 2024 02:016,07874,859,84249,440,0001,008,0002,437,120
3Nov 11, 2024 02:016,08871,165,46050,529,00002,433,024
4Nov 11, 2024 02:016,08876,474,38449,519,0001,010,0002,535,424
5Nov 11, 2024 02:016,08876,223,43050,531,00002,273,280
6Nov 11, 2024 02:016,09580,505,90850,588,00002,514,944
7Nov 11, 2024 02:016,09776,587,27750,607,00002,273,280
8Nov 11, 2024 02:016,12583,662,62250,835,00002,535,424
9Nov 11, 2024 02:016,27574,411,61251,084,0001,001,0002,437,120
10Nov 11, 2024 02:017,60083,896,83361,081,0002,002,0002,420,736
11Nov 11, 2024 02:018,08794,841,60065,115,0002,003,0002,433,024
12Nov 11, 2024 02:018,17090,675,84665,814,0001,994,0002,433,024