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 12, 2024 10:45KrishanKrishanScore: 382,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 10:45381,7553,193,348,1273,111,592,00056,974,0002,285,568
2Nov 12, 2024 10:45382,1313,202,585,6543,109,712,00061,974,0002,371,584
3Nov 12, 2024 10:45382,6483,203,515,3823,122,017,00053,965,0002,367,488
4Nov 12, 2024 10:45382,7343,200,115,7583,119,715,00056,976,0002,293,760
5Nov 12, 2024 10:45382,9293,204,064,6913,123,341,00054,970,0002,285,568
6Nov 12, 2024 10:45383,4793,213,683,9813,132,892,00049,982,0002,285,568
7Nov 12, 2024 10:45384,7303,219,099,4133,124,299,00068,962,0002,293,760
8Nov 12, 2024 10:45384,7423,220,221,0553,124,391,00068,964,0002,289,664
9Nov 12, 2024 10:45384,9283,223,101,4173,116,933,00077,973,0002,285,568