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 13, 2024 09:47glebundiyglebundiyScore: 1,826,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 09:471,825,29515,187,209,08415,076,984,00072,966,0002,281,472
2Nov 13, 2024 09:471,826,08215,190,342,85915,093,503,00062,977,0002,281,472
3Nov 13, 2024 09:471,826,13615,185,721,59015,090,955,00065,973,0002,281,472
4Nov 13, 2024 09:471,826,63015,190,543,48915,093,053,00067,973,0002,269,184
5Nov 13, 2024 09:471,826,95615,203,432,38615,093,768,00069,966,0002,281,472
6Nov 13, 2024 09:471,827,77815,201,215,39915,090,595,00079,966,0002,281,472
7Nov 13, 2024 09:471,828,71115,213,385,06615,107,331,00070,973,0002,265,088
8Nov 13, 2024 09:471,833,14515,248,587,01515,141,130,00073,971,0002,281,472
9Nov 13, 2024 09:471,862,37715,492,817,29615,385,767,00071,966,0002,281,472