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 23, 2024 14:05E SequeiraE SequeiraScore: 13,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:0513,921142,881,808114,541,0001,004,0002,281,472
2Nov 23, 2024 14:0513,925144,187,068115,578,00002,289,664
3Nov 23, 2024 14:0513,927147,674,639114,589,0001,005,0002,289,664
4Nov 23, 2024 14:0513,944142,333,652113,739,0001,995,0002,469,888
5Nov 23, 2024 14:0513,945143,306,566113,752,0001,995,0002,465,792
6Nov 23, 2024 14:0513,954140,019,804113,820,0001,996,0002,289,664
7Nov 23, 2024 14:0513,960143,612,733113,875,0001,997,0002,289,664
8Nov 23, 2024 14:0513,962147,471,323113,884,0001,997,0002,310,144
9Nov 23, 2024 14:0513,965144,163,354113,912,0001,998,0002,289,664