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 07:55Igor ZyginIgor ZyginScore: 264,064Success
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 07:55263,8052,221,363,4852,083,552,000106,028,0002,326,528
2Nov 11, 2024 07:55263,9112,218,433,8332,111,484,00078,980,0002,330,624
3Nov 11, 2024 07:55263,9472,219,001,3882,102,807,00087,950,0002,494,464
4Nov 11, 2024 07:55264,0042,221,796,0692,111,261,00079,972,0002,486,272
5Nov 11, 2024 07:55264,0642,221,444,2482,104,781,00086,949,0002,326,528
6Nov 11, 2024 07:55264,1812,226,325,1222,085,766,000106,936,0002,326,528
7Nov 11, 2024 07:55264,2702,220,365,2012,095,508,00097,930,0002,326,528
8Nov 11, 2024 07:55264,3122,220,434,2632,099,839,00093,948,0002,326,528
9Nov 11, 2024 07:55264,3562,221,421,5502,105,229,00088,925,0002,326,528