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 listApr 28, 2024 15:29Steve HanSteve HanScore: 18,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 15:2918,787214,023,352155,932,83902,297,856
2Apr 28, 2024 15:3218,802213,394,386156,058,11502,174,976
3Apr 28, 2024 15:3018,829226,976,395156,281,24902,174,976
4Apr 28, 2024 15:3018,831210,366,973156,299,17802,174,976
5Apr 28, 2024 15:3018,837212,366,721156,345,96802,301,952
6Apr 28, 2024 15:2918,841211,090,081156,376,52502,293,760
7Apr 28, 2024 15:2918,869218,664,638156,616,31602,306,048
8Apr 28, 2024 15:3018,875222,461,513156,662,71002,301,952
9Apr 28, 2024 15:3018,922213,874,286157,051,70902,297,856
10Apr 28, 2024 15:3219,639223,903,420163,000,99102,306,048
11Apr 28, 2024 15:3219,665237,506,048163,216,21702,301,952
12Apr 28, 2024 15:3019,667232,458,873163,236,20902,297,856