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 12:55SergeySergeyScore: 275,225Success
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 12:55274,0572,302,596,0252,208,715,00065,961,0002,367,488
2Nov 12, 2024 12:55274,3692,298,620,8142,216,286,00060,980,0002,285,568
3Nov 12, 2024 12:55274,5092,305,984,5982,211,440,00066,983,0002,293,760
4Nov 12, 2024 12:55274,8832,309,259,4112,221,571,00059,961,0002,293,760
5Nov 12, 2024 12:55275,2252,310,867,5212,213,384,00070,980,0002,371,584
6Nov 12, 2024 12:55275,3972,316,318,5782,205,836,00079,957,0002,293,760
7Nov 12, 2024 12:55276,7482,321,792,7552,225,041,00071,969,0002,285,568
8Nov 12, 2024 12:55277,3472,332,163,6402,237,011,00064,971,0002,293,760
9Nov 12, 2024 12:55278,6392,337,411,2992,252,734,00059,966,0002,285,568